Ad hoc node connectivity improvement analysis - Why not through mesh clients?

Authors:
R. Harikumar;Jennifer S. Raj
Affiliations:
Department of ECE, Bannari Amman Institute of Technology, Sathyamangalam, India;Department of ECE, Karunya University, Coimbatore, India and Research Scholar, Anna University, Chennai, India
Venue:
Computers and Electrical Engineering
Year:
2014

Citing 18
Cited 0

Faster Exact Solutions for Some NP-Hard Problems

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
The number of neighbors needed for connectivity of wireless networks

Wireless Networks
Improving Connectivity ofWireless Ad Hoc Networks

MOBIQUITOUS '05 Proceedings of the The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services
Random Coverage with Guaranteed Connectivity: Joint Scheduling for Wireless Sensor Networks

IEEE Transactions on Parallel and Distributed Systems
Safari: A self-organizing, hierarchical architecture for scalable ad hoc networking

Ad Hoc Networks
A study of self-organization mechanisms in ad hoc and sensor networks

Computer Communications
Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
Connectivity in a random interval graph with access points

Information Processing Letters
Connectivity maintenance and coverage preservation in wireless sensor networks

Ad Hoc Networks
Efficient clustering algorithms for self-organizing wireless sensor networks

Ad Hoc Networks
On the construction of 2-connected virtual backbone in wireless networks

IEEE Transactions on Wireless Communications
RECA: Referenced energy-based CDS algorithm in wireless sensor networks

International Journal of Communication Systems
Congestion-aware topology controls for wireless multi-hop networks

Ad Hoc Networks
Solving coverage problems in wireless sensor networks using cover sets

Ad Hoc Networks
OMAC: A new access control architecture for overlay multicast communications

International Journal of Communication Systems
The capacity of wireless networks

IEEE Transactions on Information Theory
When the greedy algorithm fails

Discrete Optimization
A linear vertex kernel for maximum internal spanning tree

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

A mobile ad-hoc network (MANET) is a complex distributed system with unpredictable node movements, which results in frequent node disconnectivity. In a MANET, each node works independently, using the resources based on individual need. The main problem with this arises during the movement of the nodes and random utilization of network resources. This work attempts to solve the mobility maintenance issues using three mesh structures; (i) mesh tree (M"T), (ii) mesh backbone (M"B) and (iii) mesh cluster (M"C). The mobility maintenance architectures are formed based on a localized connectivity analysis and the node degree as a key parameter for network construction. The performance of the proposed work is analysed through mathematical models and simulation results.