A Localized Computing Approach for Connectivity Improvement Analysis in Wireless Personal Networks

Authors:
Jennifer S. Raj;R. Harikumar
Affiliations:
Karunya University, Coimbatore, India;Department of ECE, Bannari Amman Institute of Technology, Sathy, India
Venue:
Wireless Personal Communications: An International Journal
Year:
2013

Citing 20
Cited 0

GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Capacity of Ad Hoc wireless networks

Proceedings of the 7th annual international conference on Mobile computing and networking
Exact algorithms for NP-hard problems: a survey

Combinatorial optimization - Eureka, you shrink!
The number of neighbors needed for connectivity of wireless networks

Wireless Networks
MINE and MILE: improving connectivity in mobile ad-hoc networks

ACM SIGMOBILE Mobile Computing and Communications Review
Topology control in wireless ad hoc and sensor networks

ACM Computing Surveys (CSUR)
Graph Theory With Applications

Graph Theory With Applications
Random Coverage with Guaranteed Connectivity: Joint Scheduling for Wireless Sensor Networks

IEEE Transactions on Parallel and Distributed Systems
On the θ-coverage and connectivity of large random networks

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Safari: A self-organizing, hierarchical architecture for scalable ad hoc networking

Ad Hoc Networks
Decentralised topology control algorithms for connectivity of distributed wireless sensor networks

International Journal of Sensor Networks
Short Communication: Improving connectivity in vehicular ad hoc networks: An analytical study

Computer Communications
A study of self-organization mechanisms in ad hoc and sensor networks

Computer Communications
Computing subgraph probability of random geometric graphs with applications in quantitative analysis of ad hoc networks

IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Connectivity of ad hoc wireless networks: an alternative to graph-theoretic approaches

Wireless Networks
On the connectivity analysis over large-scale hybrid wireless networks

INFOCOM'10 Proceedings of the 29th conference on Information communications
Connectivity analysis of one-dimensional ad-hoc networks

Wireless Networks
The capacity of wireless networks

IEEE Transactions on Information Theory
Multihop Ad Hoc Networking: The Theory

IEEE Communications Magazine
A survey on position-based routing in mobile ad hoc networks

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

A fundamental problem that confronts wireless networks are localization, mobility maintenance and number of neighbors required to maintain the connectivity. To overcome this problem and achieve a better quality of service, a self stability model is introduced, named as localized tree model which includes min and max routing methods. This work is based on node degree, neighbor's information and coverage area. Based on the mobility requirements of the network, dynamic structures are formed with minimum control load and complexity. Main objective of the research is to obtain the network parameters from the connectivity analysis. The performance of the proposed approach is witnessed by analyzing the parameters like scalability, packet delivery ratio and connectivity efficiency.