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
Dissertation
Efficient Data Dissemination in Wireless Ad Hoc Networks
TL;DR: Two centralized approximation algorithms are proposed to construct a D(2,k,r) to act as a virtual backbone or a clustering hierarchy in unit disk graphs and in general graphs, and upper bounds are given on the number of forwarding nodes returned by HBLF in a network with or without holes.
Energy-efficient, Reliable, and Flexible Data Transmission in Wireless Personal Area Networks
TL;DR: A clustering and routing method for hierarchical sensor networks is proposed which provides the optimal ratio of cluster-heads and a clustering scheme which expands the range of clusters until d-hop calculated by the ratio of Cluster-head.
Journal ArticleDOI
A Distributed Agent-based Approach to Manage Industrial Wireless Sensor Networks
TL;DR: An overview of a wireless sensor network management approach, the simulator platform developed using Java Agent Development Environment (JADE) that will be used to test this design, as well as preliminary experimental results using this simulator are proposed.
Proceedings ArticleDOI
A study on data aggregation scheme over wireless sensor network
TL;DR: A detailed study has been made about the available data aggregation techniques in the form of taxonomy to design a data aggregation scheme with optimal energy consumption across the sensing area to enhance the network lifetime.
Journal ArticleDOI
Coverage and connectivity-aware clustering within k hops in wireless sensor and actuator networks
Chiu-Ching Tuan,Yi-Chao Wu +1 more
TL;DR: A coverage and connectivity aware clustering within k-hops (CCAC-k), where sensors pick a cluster head before the actuators have been placed, and there are no orphan sensors in the monitored area, even when deployed randomly.
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.