The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We introduce Space-Time Routing (STR), a new approach to routing in mobile ad hoc networks. In STR, the age of routing state is considered jointly with the distance to the destination. We give a general description of STR, which can accommodate various temporal (age) and spatial (distance) metrics. Our formulation of STR describes a family of routing algorithms, parameterized by a choice of node clock...
A mobile ad hoc network suffers from the same cost constraints as most wireless networks. In particular bandwidth constraints of wireless links are severe. We present a scalable adaptive fitness-based routing protocol, SAFAR, for mobile ad hoc networks in which we try to optimize the usage of this bandwidth at every stage. The protocol is hybrid, i.e. it makes use of both proactive and reactive procedures...
Selecting the most appropriate routing protocol for a given set of conditions in a mobile ad hoc network (MANET) remains difficult. While the quantitative performance metrics are helpful in the selection, the problem is that the metrics of the protocols under consideration be generated by the same simulator in order to be comparable. The MERIT framework proposes to compare a routing protocol to a...
Most simulations and performance comparisons of mobile ad hoc network routing protocols are based on a simplistic and idealistic physical layer model. In real applications, there are different kinds of noise or interference that impact the signal power. We use a shadowing propagation model in our simulation evaluation of two on-demand routing protocols: AODV and DSR. Because of signal power fluctuation,...
This paper proposes new network architecture and algorithms for real-time mobility management in mobile IP networks. The proposed architecture and algorithms offer a better performance based on the call- to-mobility ratio (CMR) and require less time for the location update and the tunneling compared with the Mobile IP model. These results are very useful and interesting for a real-time context where...
In this paper, we analyze the advantages and disadvantages of the proactive QoS routing in ad-hoc networks. We discuss how to support bandwidth QoS routing in OLSR (Optimized Link State Protocol), a best-effort proactive MANET routing protocol. Using OPNET, we simulate the algorithm, exploring both traditional routing protocol performance metrics and QoS-specific metrics. Our analysis of the simulation...
Many routing protocols for mobile ad hoc networks have been developed. These protocols find a route to a destination if such a route exists. We present a novel protocol that delivers messages between disconnected hosts, that is, when no route exists between them. Our protocol uses the nodes moving between the neighbourhoods of the source and destination nodes to act as carriers of the messages. We...
The provision of multicast communications in wireless and wired networks has followed different paths which have led to different solutions. Little has been accomplished to-date in bringing together the traditional IP multicast model used in fixed networks and multicast routing protocols for wireless ad hoc networks. We analyse the provision of an integrated IP multicast service in which mobile hosts...
This paper models an ad-hoc network as a continuum of nodes, ignoring edge effects, to find how the traffic scales with N, the number of nodes. We obtain expressions for the traffic due to application data, packet forwarding, mobility and routing, and we find the effects of the transmission range, R, and the bandwidth. The results indicate that the design of scalable adhoc networks should target small...
Ad hoc networks consist of wireless, self-organizing nodes that can communicate with each other in order to establish decentralized and dynamically changing network topologies. Node discovery is a fundamental procedure in the establishment of an ad hoc network, as a given node needs to discover what other nodes are in its communication range. Existing multi-channel node discovery protocols are typically...
Private, corporate and public Wireless Local Area Networks (WLAN) Hot-Spots are emerging. In this rapidly evolving environment, the configuration of WLAN access points raise the classical problem of re-using limited radio resources. In this paper, the problem of dynamic frequency allocation of WLAN access point in a highly competitive multi-provider Hot-Spots environment is addressed. Our solution...
In order to improve the throughput performance of Medium Access Control (MAC) schemes in wireless communication networks, some researchers proposed to split the single shared channel into two subchannels: a control subchannel and a data subchannel. The control subchannel is used for access reservation to the data subchannel over which the data packets are transmitted, and such reservation can be done...
The design of secure routing techniques is a crucial and challenging requirement in mobile ad hoc networking. This is due to the fact that the highly dynamic nature of the ad hoc nodes, their limited transmission range, and their reliance on an implicit trust model to route packets make the routing protocols inherently susceptible to attacks. We propose a solution to prevent two important types of...
Most of the routing protocols in wireless ad hoc networks, such as DSR, assume nodes are trustworthy and cooperative. This assumption renders wireless ad hoc networks vulnerable to various types of Denial of Service (DoS) attacks. We present a distributed probing technique to detect and mitigate one type of DoS attacks, namely malicious packet dropping, in wireless ad hoc networks. A malicious node...
Many-to-Many Invocation (M2MI) is a new paradigm for building secure collaborative systems that run in true ad hoc networks of fixed and mobile computing devices. M2MI is useful for building a broad range of systems, including service discovery frameworks; groupware for mobile ad hoc collaboration; systems involving networked devices (printers, cameras, sensors); and collaborative middleware systems...
We present efficient distributed algorithms for computing 2-hop neighborhoods in Ad Hoc Wireless Networks. The knowledge of the 2-hop neighborhood is assumed in many protocols and algorithms for routing, clustering, and distributed channel assignment, but no efficient distributed algorithms for computing the 2-hop neighborhoods were previously published. The problem is nontrivial, as the graphs...
We consider topology control problems where the goal is to assign transmission powers to the nodes of an ad hoc network so as to induce graphs satisfying specific properties. The properties considered are connectivity, bounded diameter and minimum node degree. The optimization objective is to minimize the total power assigned to nodes. As these problems are NP-hard in general, our focus is on developing...
The data-centric ad hoc sensor networks make efficient searching a crucial and challenging operation. Dynamic topology make flooding the most widely adopted solution at a cost of high bandwidth congestion leading to inefficient use of resources and low network lifetime. This paper presents IDEA, an efficient querying and searching technique for ad hoc sensor networks that reduces average energy consumption...
The minimization of expended energy for unicast and broadcast communication between nodes in a wireless network has been studied mostly as a path optimization problem without particular regard for the traffic load demands. In this paper, we consider the call admission problem whereby given a traffic load (described as source-destination rate demands) the required expended energy is minimized. In addition,...
Currently, there are many technologies available to automate public utilities services (water, gas and electricity). AMR, Automated Meter Reading, and SCADA, Supervisory Control and Data Acquisition, are the main functions that these technologies must support. In this paper, we propose a low cost network with a similar architecture to a static ad-hoc sensor network based on low power and unlicensed...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.