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
Proceedings ArticleDOI
Geometric spanner 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.
Proceedings ArticleDOI
CogMesh: A Cluster-Based Cognitive Radio Network
TL;DR: This paper proposes a cluster-based framework to form a wireless mesh network in the context of open spectrum sharing and identifies issues in such a network and provides mechanisms for neighbor discovery, cluster formation, network formation, and network topology management.
Proceedings ArticleDOI
Topology management in ad hoc networks
TL;DR: This work proposes a distributed topology management algorithm that constructs and maintains a backbone topology based on a minimal dominating set (MDS) of the network that shows better behavior and higher stability in ad hoc networks than prior algorithms.
Proceedings ArticleDOI
Connectivity based k-hop clustering in wireless networks
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.
Proceedings ArticleDOI
Random key-assignment for secure Wireless Sensor Networks
TL;DR: A probabilistic model and two protocols to establish a secure pair-wise communication channel between any pair of sensors in the WSN, by assigning a small set of random keys to each sensor, are described.
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.