|
| A Self-Deployment Obstacle Avoidance (SOA)Algorithm for Mobile Sensor Networks
|
|
Full
text: |
 PDF(542.2KB) |
|
|
Source |
International Journal of Computer Science and Security (IJCSS) |
|
Table of Contents |
|
|
Download
Complete Issue PDF(4.51MB) |
|
Volume: 4 Issue: 3 |
| |
Pages: 265-372 |
|
Publication
Date: July 2010 |
|
ISSN
(Online): 1985-1553 |
|
|
|
|
|
Pages |
316 - 330 |
|
Author(s) |
|
|
|
Published
Date |
10-08-2010 |
|
Publisher |
CSC
Journals, Kuala Lumpur,
Malaysia |
|
ADDITIONAL
INFORMATION |
| Keywords Abstract References Cited by Related Articles Collaborative
Colleague |
| |
|
| |
KEYWORDS: mobile nodes, mobile networks, self deployment, sensor networks. |
|
|
| |
|
|
| This Manuscript is indexed in the following databases/websites:- |
|
| 1. Directory of Open Access Journals (DOAJ) |
| 2. Docstoc |
| 3. PDFCAST |
| 4. Scribd |
| 5. WorldCat |
| 6. Bielefeld Academic Search Engine (BASE) |
| 7. Academic Index |
| 8. refSeek |
| 9. Socol@r |
| 10. iSEEK |
| 11. Google Scholar |
| 12. ResearchGATE |
| 13. Academic Journals Database |
| 14. Libsearch |
| 15. slideshare |
| |
|
| |
|
|
| A mobile sensor network is a distributed collection of nodes, each of which has
sensing, computing, communicating, and locomotion capabilities. This paper presents a self-deployment obstacle avoidance (SOA) algorithm for mobile sensor networks. The proposed SOA algorithm provides full coverage and can be efficiently used in a complex, unstable, and unknown environment. Moreover, the SOA algorithm is implemented based on the assumption that nodes are randomly deployed near the sink where each node knows the location of the target. In proposed SOA algorithm, the nodes determine a partner node and link up effectively to form a node pair. A node pair which is closest to the target searches for the target with all other node pairs following the previous node. There are number of priority rules on which the mobility of sensor nodes is based. The SOA algorithm ensures that the nodes determine a path around any obstacles. Once a connection is established from the sink to the target, the node pair separates and starts providing the full coverage. The experimental verifications and simulation results demonstrate that the proposed algorithm provides three main advantages. First, it reduces the total computation cost. Second, it increases the stability of the system. Third, it provides greater coverage to unknown and unstable environment. |
| |
|
| |
|
| |
| 1 |
Y. Liang, C. Weidong, X. Yugeng. “A review of control and localization for mobile sensor networks”. In Proceedings of the Sixth World Congress on Intelligent Control and Automation (WCICA 2006), pp. 9164-9168, Dalian, China, 2006.
|
|
|
| 2 |
T. Jindong, X. Ning. “Integration of sensing, computation, communication and cooperation for distributed mobile sensor networks”. In Proceedings of the IEEE International Conference on Robotics, Intelligent Systems and Signal Processing, pp. 54- 59, 2003.
|
|
|
| 3 |
J. Takahashi, K. Sekiyama, T. Fukuda. "Self-Deployment algorithm of mobile sensor network based on connection priority criteria". Proceedings of 2007 International Symposium on Micro-Nano Mechatronics and Human Science (MHS2007), pp. 564-569, 2007.
|
|
|
| 4 |
M. Singh, M. Gore. “A solution to sensor network coverage problem”. In Proceedings of the 2005 IEEE International Conference on Personal Wireless Communications, (ICPWC), pp. 77-80, January, 2005.
|
|
|
| 5 |
R. Tynan, G. DavidMarsh, D. O'Kane. “Interpolation for wireless sensor network coverage”. In Proceedings of the Second IEEE Workshop on Embedded Networked Sensors, pp. 123- 131, 2005.
|
|
|
| 6 |
M. Cheng, L. Ruan, W. Wu. “Achieving minimum coverage breach under bandwidth constraints in wireless sensor networks”. In Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 2638- 2645, 2005.
|
|
|
| 7 |
S. Ram, D. Majunath, S. Iyer, D. Yogeshwaran. “On the path coverage properties of random sensor networks”, IEEE Transaction on Mobile Computing, 6(5): 494-506, 2007.
|
|
|
| 8 |
P. Pennesi, C. Paschalidis. “Solving sensor network coverage problems by distributed asynchronous actor-critic methods”. In Proceedings of the 46th IEEE Conference on Decision and Control, pp. 5300-5305, 2007.
|
|
|
| 9 |
N. Aziz, A. Mohemmed, D. Sagar. “Particle swarm pptimization and voronoi diagram for wireless sensor networks coverage optimization” In Proceedings of the International Conference on Intelligent and Advanced Systems, pp. 961-965, 2007.
|
|
|
| 10 |
J. Kanno, J. Buchart, R. Selmic, V. Phoha, “Detecting coverage holes in wireless sensor networks”. In Proceedings of the 2009 17th Mediterranean Conference on Control and Automation, pp.452-457, Thessaloniki, Greece June 2009.
|
|
|
| 11 |
Y. Li and Y. Liu, "Energy saving target tracking using mobile sensor networks". In Proceedings of the IEEE International Conference on Robotics and Automation, pp. 674-679, April 2007
|
|
|
| 12 |
S. Zhang, J. Cao, L. Chen, D. Chen. "Locating nodes in mobile sensor networks more accurately and faster". In Proceedings of the 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, (SECON '08), pp. 37-45, San Francisco, CA, 2008.
|
|
|
| 13 |
J. Lu, T. Suda. "Differentiated surveillance for static and random mobile sensor networks. IEEE transactions on wireless communications, 7(11): 4411-4423, 2008.
|
|
|
| 14 |
A. Rai, S. Ale, S. Rizvi, A. Riasat. ”New methodology for self localization in wireless sensor networks”. Journal of Communication and Computer, 6(11): 37-44, 2009.
|
|
|
| 15 |
S. Rizvi and A. Riasat, “Use of self-adaptive methodology in wireless sensor networks for reducing energy consumption,” IEEE International Conference on Information and Emerging Technologies (IEEE ICIET-2007), pp. 1 – 7, July 06-07, 2007.
|
|
|
| |
|
| |
|
| |
| 1 |
M. AL-Bzoor , L. Almazaydeh and S. S. Rizvi , “Hierarchical Coordination for Data Gathering (HCDG) in Wireless Sensor Networks”, International Journal of Computer Science and Security (IJCSS), 5(5), pp. 443 – 455, 2011.
|
|
|
| |
|
| |
|
| |
| 1 |
TechRepublic
|
| 2 |
shendusou.com
|
| 3 |
ZDNet
|
| 4 |
University of Bridgeport
|
| 5 |
Syed Rizvi
|
| 6 |
DocumentSearch.org
|
| |
|
| |
|
| |
|
| Bryan Sarazin : Colleagues
|
|
| Syed S. Rizvi : Colleagues
|
|
