Proceedings ArticleDOI
Max-min d-cluster formation in wireless ad hoc networks
Alan D. Amis,Ravi Prakash,T.H.P. Vuong,D.T. Huynh +3 more
- Vol. 1, pp 32-41
TLDR
A heuristic to form d-clusters in a wireless ad hoc network that tends to re-elect existing clusterheads even when the network configuration changes and has a tendency to evenly distribute the mobile nodes among the clusterheads, and evently distribute the responsibility of acting as clusterheads among all nodes.Abstract:
An ad hoc network may be logically represented as a set of clusters. The clusterheads form a d-hop dominating set. Each node is at most d hops from a clusterhead. Clusterheads form a virtual backbone and may be used to route packets for nodes in their cluster. Previous heuristics restricted themselves to 1-hop clusters. We show that the minimum d-hop dominating set problem is NP-complete. Then we present a heuristic to form d-clusters in a wireless ad hoc network. Nodes are assumed to have a non-deterministic mobility pattern. Clusters are formed by diffusing node identities along the wireless links. When the heuristic terminates, a node either becomes a clusterhead, or is at most d wireless hops away from its clusterhead. The value of d is a parameter of the heuristic. The heuristic can be run either at regular intervals, or whenever the network configuration changes. One of the features of the heuristic is that it tends to re-elect existing clusterheads even when the network configuration changes. This helps to reduce the communication overheads during transition from old clusterheads to new clusterheads. Also, there is a tendency to evenly distribute the mobile nodes among the clusterheads, and evently distribute the responsibility of acting as clusterheads among all nodes. Thus, the heuristic is fair and stable. Simulation experiments demonstrate that the proposed heuristic is better than the two earlier heuristics, namely the LCA and degree-based solutions.read more
Citations
More filters
Journal ArticleDOI
Geometric spanners for routing in mobile networks
TL;DR: It is shown by simulation that the RDG outperforms previously proposed routing graphs in the context of the Greedy perimeter stateless routing (GPSR) protocol, and theoretical bounds on the quality of paths discovered using GPSR are investigated.
Journal ArticleDOI
Extended dominating-set-based routing in ad hoc wireless networks with unidirectional links
TL;DR: An efficient localized algorithm for determining a dominating and absorbant set of vertices (mobile hosts) is given and this set can be easily updated when the network topology changes dynamically, extending dominating-set-based routing to networks with unidirectional links.
Journal ArticleDOI
Optimal base-station locations in two-tiered wireless sensor networks
TL;DR: By proposing algorithmic approaches to locate BSs optimally, this paper can maximize the topological network lifetime of WSNs deterministically, even when the initial energy provisioning for ANs is no longer always proportional to their average bit-stream rate.
Journal ArticleDOI
Minimizing communication costs in hierarchically-clustered networks of wireless sensors
Seema Bandyopadhyay,E.J. Coyle +1 more
TL;DR: The technique used to minimize communication costs combines analytical results from stochastic geometry with a distributed, randomized algorithm for generating clusters of sensors to achieve the minimum communication energy.
Book
Algorithms And Protocols For Wireless Mobile Ad Hoc Networks
TL;DR: This book covers everything you need to build a foundation for the design of future mobile ad hoc networks and is complemented with a set of exercises that challenge you to test your understanding of the material.
References
More filters
Proceedings ArticleDOI
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
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.
Journal ArticleDOI
Approximation algorithms for combinatorial problems
TL;DR: For the problem of finding the maximum clique in a graph, no algorithm has been found for which the ratio does not grow at least as fast as n^@e, where n is the problem size and @e>0 depends on the algorithm.
Proceedings ArticleDOI
A highly adaptive distributed routing algorithm for mobile wireless networks
V.D. Park,M.S. Corson +1 more
TL;DR: The proposed protocol is a new distributed routing protocol for mobile, multihop, wireless networks that is highly adaptive, efficient and scalable; being best-suited for use in large, dense, mobile networks.
Journal ArticleDOI
Multicluster, mobile, multimedia radio network
Mario Gerla,Jack Tzu-Chieh Tsai +1 more
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.
Journal ArticleDOI
A design concept for reliable mobile radio networks with frequency hopping signaling
TL;DR: This paper outlines those features that distinguish the High Frequency (HF) Intra Task Force (ITF) Network from other packet radio networks, and presents a design concept for this network that encompasses organizational structure, waveform design, and channel access.