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
Design and analysis of mobility-aware clustering algorithms for wireless mesh networks
TL;DR: This work identifies the cases where clustering is helpful and proposes two clustering schemes that take into consideration the mobility properties of the users in order to improve the WMN performance and proves that both schemes can achieve significant gains in terms of radio resource utilization.
Proceedings ArticleDOI
Analysis of Clustering and Routing Overhead for Clustered Mobile Ad Hoc Networks
TL;DR: It is observed that the control overhead in a clustered network is closely related to different network parameters, e.g. node mobility, node transmission range, network size, and network density, which facilitates the design of efficient clustering algorithms in order to minimize theControl overhead.
Proceedings ArticleDOI
Hierarchical Character Oriented Wildlife Species Recognition Through Heterogeneous Wireless Sensor Networks
TL;DR: A new tiered heterogeneous wireless image sensor network for real-time unobtrusive species detection and video cataloguing based on a new hierarchically scalarized-character oriented detection algorithm and architecture is proposed.
Proceedings ArticleDOI
Minimum-cost gateway deployment in cellular Wi-Fi networks
R. Prasad,Hongyi Wu +1 more
TL;DR: Simulation results show that the proposed approaches can effectively identify a set of gateways at optimal locations in a cellular Wi-Fi network, resulting in an overall cost reduction of up to 50%.
Proceedings ArticleDOI
Competitive Self-Stabilizing k-Clustering
TL;DR: This paper proposes a silent self-stabilizing asynchronous distributed algorithm for constructing a k-clustering of any connected network with unique IDs, and shows that the distributed MIS tree construction is a P-complete problem.
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.