- About this Journal
- Abstracting and Indexing
- Aims and Scope
- Annual Issues
- Article Processing Charges
- Articles in Press
- Author Guidelines
- Bibliographic Information
- Citations to this Journal
- Contact Information
- Editorial Board
- Editorial Workflow
- Free eTOC Alerts
- Publication Ethics
- Reviewers Acknowledgment
- Submit a Manuscript
- Subscription Information
- Table of Contents
International Journal of Distributed Sensor Networks
Volume 2012 (2012), Article ID 452686, 11 pages
doi:10.1155/2012/452686
An Effective Find and Replicate Strategy for Data Communication in Intermittently Connected Wireless Ad Hoc and Sensor Networks
1Department of Information Technology, Kongu Engineering College, Erode 638-052, India
2Department of Computer Science, Bannari Institute of Technology, Erode 638-401, India
Received 12 July 2012; Revised 10 October 2012; Accepted 24 October 2012
Academic Editor: Deyun Gao
Copyright © 2012 C. Poongodi and A. M. Natarajan. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract
ICWASNs are a kind of wireless networks where, due to mobility of nodes and lack of connectivity, there may be frequent disconnections among the nodes. Hence, the routing path from the source to destination will not be available always. It is proven that, in these networks, messages are replicated multiple times in order to withstand the maximum delay and to achieve high throughput. But these multiple replication-based protocols result in an increase in network overhead and high resource consumption because of uncontrolled replication. Previous works in ICWASNs assume that networks will always have multiple partitions, and each message will be routed using store and forward mechanism. If source and destination are connected, then it is not needed to replicate multiple copies and waste the resources. We introduce a new simple scheme which applies single-copy routing if destination is available; else it switches to store and forward routing. The proposed system tries to reduce the average number of message replications while increasing the throughput.