A heterogeneous routing protocol based on a new stable clustering scheme
07 Oct 2002-Vol. 2, pp 838-843
TL;DR: A new heterogeneous routing protocol specifically designed for the hierarchical ad hoc network is proposed and a new active clustering scheme is presented to help build a stable hierarchical structure, which is fundamental toheterogeneous routing protocols.
Abstract: A mobile ad hoc network (MANET) is usually assumed to be homogeneous, where each mobile node shares the same radio capacity. However, a homogeneous ad hoc network suffers from poor scalability. Research has demonstrated its performance bottleneck both theoretically and through simulation experiments. Building a physically hierarchical ad hoc network is a very promising way to achieve scalability. Routing is critical to operate such a hierarchical structure efficiently. Previous research has been solely focusing on extending popular routing schemes developed for the homogeneous ad hoc network. We propose a new heterogeneous routing protocol specifically designed for the hierarchical ad hoc network. We also present a new active clustering scheme to help build a stable hierarchical structure, which is fundamental to heterogeneous routing protocols. Simulation results using GloMoSim show that our routing and clustering scheme gives good performance. The results also provide some insight into new possible designs of routing protocols and mobile network architectures for MANETs when large scale is desired.
Citations
More filters
TL;DR: A taxonomy and general classification of published clustering schemes for WSNs is presented, highlighting their objectives, features, complexity, etc and comparing of these clustering algorithms based on metrics such as convergence rate, cluster stability, cluster overlapping, location-awareness and support for node mobility.
2,283 citations
Cites methods from "A heterogeneous routing protocol ba..."
...Random competition based clustering (RCC): Although RCC [52] is designed for mobile ad hoc networks, it is also applicable to WSNs....
[...]
...Although fre- quent node mobility still has direct effect, RCC is shown to be more stable than conventional clustering schemes such as [51]....
[...]
...A CH in adaptive clustering abandons its role when it hears a node with a lower ID, while, a CH in RCC only gives up its position when another CH moves near to it....
[...]
...Since random timer is not a complete solution, RCC resolve further the concurrent broadcast problems by using the node ID....
[...]
...Some of the proposed clustering algorithms such as LCA [48], RCC [52] and CLUBS [53], have O(n) convergence time, where n represent the number of sensor nodes in the network....
[...]
19 Jan 2004
TL;DR: The efficient subdivision of a sensor network into uniform, mostly non-overlapping clusters of physically close nodes is an important building block in the design of efficient upper layer network functions such as routing, broadcast, data aggregation, and query processing.
Abstract: The efficient subdivision of a sensor network into uniform, mostly non-overlapping clusters of physically close nodes is an important building block in the design of efficient upper layer network functions such as routing, broadcast, data aggregation, and query processing.
417 citations
Cites methods from "A heterogeneous routing protocol ba..."
...Some researchers propose using a random number as a heuristic for cluster-head selectio n [8, 12, 18, 25]....
[...]
TL;DR: About 215 most important WSN clustering techniques are extracted, reviewed, categorized and classified based on clustering objectives and also the network properties such as mobility and heterogeneity, providing highly useful insights to the design of clustering Techniques in WSNs.
150 citations
TL;DR: Several efficient clustering algorithms for maximizing the lifetime of WSNs, i.e., the duration till a certain percentage of the nodes die, are presented and help provide useful benchmarks for various centralized and distributed clustering scheme designs.
127 citations
Cites background from "A heterogeneous routing protocol ba..."
...…sensor network, energy harvesting wireless sensor, ∗Corresponding author Email addresses: pzhang1@e.ntu.edu.sg (Pengfei Zhang), egxxiao@ntu.edu.sg (Gaoxi Xiao), hptan@i2r.a-star.edu.sg (Hwee-Pink Tan) Preprint submitted to Computer Networks April 27, 2013 clustering algorithm, network lifetime...
[...]
...…2007; Peng et al., 2007; Ye et al., 2005; Younis and Fahmy, 2004; Zhang et al., 2008), enhancement of cluster stability in various network topologies (Hou and Tsai, 2001; Xu and Gerla, 2002), MAC layer design (Van Dam and Langendoen, 2003; Ye et al., 2002; Younis and Fahmy, 2004) and many more....
[...]
TL;DR: A system model for data access, stable clustering of aircraft, and efficient routing schemes are introduced, which are suitable for the aeronautical mobility model, and relative velocity between nodes is adequate as a stability metric, dominating relative distance.
Abstract: In this paper, the concept of a new form of mobile network formed in the sky is introduced, where the mobile routers are simply the commercial aircraft. This implementation aims to eliminate two main problems arising from the current in-flight broadband implementation. The first problem is the resource management issue that may arise from the rapid increase of in-flight broadband Internet use in the near future. This could consequently limit current satellite resources, and bandwidth. The other issue is the inherent problem associated with Internet use over satellite, such as the degraded performance of delay sensitive applications due to the long propagation delay of a satellite link. A system model for data access, stable clustering of aircraft, and efficient routing schemes are introduced, which are suitable for the aeronautical mobility model. Link stability is predicted by a novel approach using Doppler shift subjected to control packets to dynamically form stable clustering and routing protocols. Another aim of this paper is to show that relative velocity between nodes is adequate as a stability metric, dominating relative distance, and this becomes evident in the simulations presented. An outline of how the new system could potentially interact with the traditional Internet using Mobile IP is also briefly discussed
126 citations
Additional excerpts
...Section V concludes the paper....
[...]
References
More filters
25 Feb 1999
TL;DR: An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.
Abstract: An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. We present Ad-hoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad-hoc networks. Each mobile host operates as a specialized router, and routes are obtained as needed (i.e., on-demand) with little or no reliance on periodic advertisements. Our new routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad-hoc networks. AODV provides loop-free routes even while repairing broken links. Because the protocol does not require global periodic routing advertisements, the demand on the overall bandwidth available to the mobile nodes is substantially less than in those protocols that do necessitate such advertisements. Nevertheless we can still maintain most of the advantages of basic distance vector routing mechanisms. We show that our algorithm scales to large populations of mobile nodes wishing to form ad-hoc networks. We also include an evaluation methodology and simulation results to verify the operation of our algorithm.
11,360 citations
TL;DR: When n identical randomly located nodes, each capable of transmitting at W bits per second and using a fixed range, form a wireless network, the throughput /spl lambda/(n) obtainable by each node for a randomly chosen destination is /spl Theta/(W//spl radic/(nlogn)) bits persecond under a noninterference protocol.
Abstract: When n identical randomly located nodes, each capable of transmitting at W bits per second and using a fixed range, form a wireless network, the throughput /spl lambda/(n) obtainable by each node for a randomly chosen destination is /spl Theta/(W//spl radic/(nlogn)) bits per second under a noninterference protocol. If the nodes are optimally placed in a disk of unit area, traffic patterns are optimally assigned, and each transmission's range is optimally chosen, the bit-distance product that can be transported by the network per second is /spl Theta/(W/spl radic/An) bit-meters per second. Thus even under optimal circumstances, the throughput is only /spl Theta/(W//spl radic/n) bits per second for each node for a destination nonvanishingly far away. Similar results also hold under an alternate physical model where a required signal-to-interference ratio is specified for successful receptions. Fundamentally, it is the need for every node all over the domain to share whatever portion of the channel it is utilizing with nodes in its local neighborhood that is the reason for the constriction in capacity. Splitting the channel into several subchannels does not change any of the results. Some implications may be worth considering by designers. Since the throughput furnished to each user diminishes to zero as the number of users is increased, perhaps networks connecting smaller numbers of users, or featuring connections mostly with nearby neighbors, may be more likely to be find acceptance.
9,008 citations
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
"A heterogeneous routing protocol ba..." refers background in this paper
...Node mobility model is random waypoint mobility [11]....
[...]
...fewer than 100 nodes) [10][11]....
[...]
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
"A heterogeneous routing protocol ba..." refers methods in this paper
...Our implementation of Ondemand – Proactive protocol is AODV in the backbone network and DSDV [12] in the local subnets (AODV – DSDV)....
[...]