Towards augmented connectivity with delay constraints in WSN federation Online publication date: Tue, 13-Nov-2012
by Fadi M. Al-Turjman; Hossam S. Hassanein
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 11, No. 2/3, 2012
Abstract: Inconsiderate WSN federation can impose a major network delay. In this paper, we look into the problem of WSN federation while considering a restricted delay between the federated segments. Towards this end, we propose two schemes for relay node placement in federating WSNs: Connectivity-Based Placement (CBP) and Connectivity-Based Placement with Delay-constraint (CBP-D). CBP maximises the connectivity of the network without any delay considerations, while CBP-D maximises the network connectivity with an upper bound on the maximum delay. We model the disjoint segments of the network to be federated into graph vertices and populate first phase relays to establish a connected graph. Consequently, second phase relays are populated to maximise the graph connectivity while maintaining cost (in CBP) and delay constraints (in CBP-D). Simulation results show that our schemes maximise the network connectivity significantly as compared to existing placement schemes in WSN federation, in addition to guaranteeing a very limited delay.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook