K-hop cluster-based dynamic source routing in wireless ad-hoc packet radio network
18 May 1998-Vol. 1, pp 224-228
TL;DR: This work presents a generalized approach called "k-hop cluster-based dynamic source routing", which is simple and can take actions on the host movements quickly and consider the overall channel utilization as well as host mobility.
Abstract: The existing wireless networks, such as cellular networks, personal communication services and mobile Internet protocol use the fixed network as their backbones. However in the situations like disaster rescues, wireless conferences in the hall, or battlefields, there exists no fixed communication infrastructure. Therefore, routing to send data packets to their destinations becomes very difficult. Distance vector and link state protocols used in the existing fixed networks are not suitable for supporting host movements. Variations of distance vector protocol, dynamic source muting schemes, and cluster-based schemes have been suggested to solve the muting problem in this entirely wireless network. However, since the link channel resource is very scarce, the muting scheme must consider the overall channel utilization as well as host mobility. We present a generalized approach called "k-hop cluster-based dynamic source routing". This approach is simple and can take actions on the host movements quickly.
Citations
More filters
07 Jan 2002
TL;DR: This paper proposes to combine two known approaches into a single clustering algorithm which considers connectivity as a primary criterion and lower ID as secondary criterion for selecting cluster heads, to minimize the number of clusters.
Abstract: In this paper we describe several new clustering algorithms for nodes in a mobile ad hoc network. We propose to combine two known approaches into a single clustering algorithm which considers connectivity as a primary criterion and lower ID as secondary criterion for selecting cluster heads. The goal is to minimize the number of clusters, which results in dominating sets of smaller sizes (this is important for applications in broadcasting and Bluetooth formation). We also describe algorithms for modifying cluster structure in the presence of topological changes. Next, we generalize the cluster definition so that a cluster contains all nodes that are at a distance of at most k hops from the cluster head. The efficiency of four clustering algorithms (k-lowestID and k-CONID, k=1 and k=2) is tested by measuring the average number of created clusters, the number of border nodes, and the cluster size in random unit graphs. The most interesting experimental result is stability of the ratio of the sum of CHs and border nodes in the set. It was constantly 60-70% for 1-lowestID and 46-56% for 1-ConID, for any value of n (number of nodes) and d (average node degree). Similar conclusions and similar number were obtained for k=2. We also proposed a unified framework for most existing and new clustering algorithms where a properly defined weight at each node is the only difference in the algorithm. Finally, we propose a framework for generating random unit graphs with obstacles.
301 citations
TL;DR: The main contribution is to generalize the cluster definition and formation algorithm so that a cluster contains all nodes that are at distance at most k hops from the clusterhead.
Abstract: In this paper we describe several new clustering algorithms for nodes in a mobile ad hoc network. The main contribution is to generalize the cluster definition and formation algorithm so that a cluster contains all nodes that are at distance at most k hops from the clusterhead. We also describe algorithms for modifying cluster structure in the presence of topological changes. We also proposed an unified framework for most existing and new clustering algorithm where a properly defined weight at each node is the only difference in otherwise the same algorithm. This paper studied node connectivity and node ID as two particular weights, for k=1 and k=2. Finally, we propose a framework for generating random unit graphs with obstacles.
278 citations
TL;DR: A multiple access scheme for the broadcast of control messages is designed, and a new access-based clustering protocol (ABCP) whose cluster formation is heavily influenced by the outcome of the multiple access is proposed, providing a generic, flexible, rapidly deployed and stable cluster architecture for the upper layer protocols.
Abstract: The ad hoc network is a temporary wireless system without a fixed (wired or wireless) infrastructure. Many clustering algorithms have been proposed to partition mobile users into clusters to support routing and network management. Most previous studies, however, focus on algorithm design, lacking an overall evaluation of clustering overheads. We design a multiple access scheme for the broadcast of control messages, and propose a new access-based clustering protocol (ABCP) whose cluster formation is heavily influenced by the outcome of the multiple access. By taking into account many delicate aspects in the clustering process, the ABCP provides a generic, flexible, rapidly deployed and stable cluster architecture for the upper layer protocols. Simulation is used to compare ABCP with the other clustering strategy in terms of cluster stability and overheads. Since ABCP makes clustering decision directly based on the result of channel access, it requires fewer control overheads and has shorter convergence time than the other clustering criteria. We also demonstrate that the resulting cluster structure by ABCP behaves stable in face of topology changes.
231 citations
Cites background from "K-hop cluster-based dynamic source ..."
...Thus, in another school of thought [8]–[11], [15]–[18], clusterheads are elected to form the upperlayer backbone....
[...]
TL;DR: This paper proposes a new mechanism that improves TCP performance in a wireless ad hoc network where each node can buffer ongoing packets during a route disconnection and re-establishment and compares the proposed TCP-BuS approach with general TCP and TCP-Feedback.
Abstract: Reliable data transmission over wireless multi-hop networks, called ad hoc networks, has proven to be non-trivial TCP (Transmission Control Protocol), a widely used end-to-end reliable transport protocol designed for wired networks, is not entirely suitable for wireless ad hoc networks due to the inappropriateness of TCP congestion control schemes Specifically, the TCP sender concludes that there is network congestion upon detecting packet losses or at time-outs However, in wireless ad hoc networks, links are broken as a result of node mobility and hence some time is needed to perform route reconfiguration During this time, packets could be lost or held back Hence, the TCP sender could mistake this event as congestion, which is untrue A route disconnection should be handled differently from network congestion In this paper, we propose a new mechanism that improves TCP performance in a wireless ad hoc network where each node can buffer ongoing packets during a route disconnection and re-establishment In addition to distinguishing network congestion from route disconnection due to node mobility, we also incorporate new measures to deal with reliable transmission of important control messages and exploitation of TCP fast recovery procedures Our simulation compares the proposed TCP-BuS approach with general TCP and TCP-Feedback Results reveal that TCP-BuS outperforms other approaches in terms of communication throughput under the presence of mobility
160 citations
18 Jun 2000
TL;DR: This paper proposes a new mechanism that improves TCP performance in a wireless ad hoc network where each node can buffer ongoing packets during a route disconnection and re-establishment and compares the proposed TCP-BuS approach with general TCP and TCP-Feedback.
Abstract: Reliable data transmission over a wireless multi-hop network, called the ad hoc network, has proven to be non-trivial. The TCP (transmission control protocol), a widely used end-to-end reliable transport protocol in a wired network, is not entirely suitable when applied to a wireless ad hoc network due to TCP's congestion control schemes. In particular, the TCP at the source considers the network as congested when detecting packet losses or timeouts. However, in a wireless ad hoc network when a route disconnection occurs because of node movement, the network mistakes this as a congestion. Therefore, the conventional TCP congestion control mechanism cannot be applied, because a route disconnection must be handled differently from a network congestion. We propose a new mechanism that improves the TCP performance in a wireless ad hoc network where each node can buffer packets during a route disconnection and reestablishment. Additionally, we incorporate new measures to deal with the reliable transmission of important control messages. Our simulation results further confirmed these advantages.
99 citations
References
More filters
01 Jan 1994
TL;DR: In this article, the authors present a protocol for routing in ad hoc networks that uses dynamic source routing, which adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Abstract: An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. In such an environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination, due to the limited range of each mobile host’s wireless transmissions. This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing. The protocol adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently. Based on results from a packet-level simulation of mobile hosts operating in an ad hoc network, the protocol performs well over a variety of environmental conditions such as host density and movement rates. For all but the highest rates of host movement simulated, the overhead of the protocol is quite low, falling to just 1% of total data packets transmitted for moderate movement rates in a network of 24 mobile hosts. In all cases, the difference in length between the routes used and the optimal route lengths is negligible, and in most cases, route lengths are on average within a factor of 1.01 of optimal.
8,614 citations
01 Jan 1996
TL;DR: This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Abstract: An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. In such an environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination, due to the limited range of each mobile host’s wireless transmissions. This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing. The protocol adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently. Based on results from a packet-level simulation of mobile hosts operating in an ad hoc network, the protocol performs well over a variety of environmental conditions such as host density and movement rates. For all but the highest rates of host movement simulated, the overhead of the protocol is quite low, falling to just 1% of total data packets transmitted for moderate movement rates in a network of 24 mobile hosts. In all cases, the difference in length between the routes used and the optimal route lengths is negligible, and in most cases, route lengths are on average within a factor of 1.01 of optimal.
8,256 citations
01 Oct 1994
TL;DR: The modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile hosts.
Abstract: An ad-hoc network is the cooperative engagement of a collection of Mobile Hosts without the required intervention of any centralized Access Point. In this paper we present an innovative design for the operation of such ad-hoc networks. The basic idea of the design is to operate each Mobile Host as a specialized router, which periodically advertises its view of the interconnection topology with other Mobile Hosts within the network. This amounts to a new sort of routing protocol. We have investigated modifications to the basic Bellman-Ford routing mechanisms, as specified by RIP [5], to make it suitable for a dynamic and self-starting network mechanism as is required by users wishing to utilize ad hoc networks. Our modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile Hosts. Finally, we describe the ways in which the basic network-layer routing can be modified to provide MAC-layer support for ad-hoc networks.
6,877 citations
TL;DR: A multi-cluster, multi-hop packet radio network architecture for wireless adaptive mobile information systems is presented that supports multimedia traffic and relies on both time division and code division access schemes.
Abstract: A multi-cluster, multi-hop packet radio network architecture for wireless adaptive mobile information systems is presented. The proposed network supports multimedia traffic and relies on both time division and code division access schemes. This radio network is not supported by a wired infrastructure as conventional cellular systems are. Thus, it can be instantly deployed in areas with no infrastructure at all. By using a distributed clustering algorithm, nodes are organized into clusters. The clusterheads act as local coordinators to resolve channel scheduling, perform power measurement/control, maintain time division frame synchronization, and enhance the spatial reuse of time slots and codes. Moreover, to guarantee bandwidth for real time traffic, the architecture supports virtual circuits and allocates bandwidth to circuits at call setup time. The network is scalable to large numbers of nodes, and can handle mobility. Simulation experiments evaluate the performance of the proposed scheme in static and mobile environments.
1,610 citations
TL;DR: The impact of node mobility and wireless communication on routing system design is discussed, and the set of techniques employed in or proposed for routing in mobile wireless networks is surveyed.
Abstract: Mobile wireless networks pose interesting challenges for routing system design. To produce feasible routes in a mobile wireless network, a routing system must be able to accommodate roving users, changing network topology, and fluctuat- ing link quality. We discuss the impact of node mobility and wireless communication on routing system design, and we survey the set of techniques employed in or proposed for routing in mobile wireless networks.
314 citations