Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 30982
High Perfomance Communication Protocol for Wireless Ad-Hoc Sensor Networks

Authors: Toshihiko Sasama, Takahide Yanaka, Kazunori Sugahara, Hiroshi Masuyama


In order to monitor for traffic traversal, sensors can be deployed to perform collaborative target detection. Such a sensor network achieves a certain level of detection performance with the associated costs of deployment and routing protocol. This paper addresses these two points of sensor deployment and routing algorithm in the situation where the absolute quantity of sensors or total energy becomes insufficient. This discussion on the best deployment system concluded that two kinds of deployments; Normal and Power law distributions, show 6 and 3 times longer than Random distribution in the duration of coverage, respectively. The other discussion on routing algorithm to achieve good performance in each deployment system was also addressed. This discussion concluded that, in place of the traditional algorithm, a new algorithm can extend the time of coverage duration by 4 times in a Normal distribution, and in the circumstance where every deployed sensor operates as a binary model.

Keywords: routing algorithm, coverage rate, binary sensor, power energy consumption, sensor deployment

Digital Object Identifier (DOI):

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1016


[1] Crossbow Technology Inc;
[2] A. Mainwaring et al., "Wireless sensor networks for habitat monitoring," Workshop on Wireless Sensor Networks and Appliances, pp.88-97, 2002.
[3] T.Yanaka, T.Sasama, and H.Masuyama, "Sensor disposition problem in wireless sensor networks," Third Int. Conf. and Workshops, ISA 2009, pp.485-493, June 2009.
[4] B.Liu and D.Towsly, "A study of the coverage of large-scale sensor networks," First IEEE Intrernational Conference on Mobile Ad-Hoc and Sensor Systems, pp.475-483, October 2004.
[5] F.Xing, C.Lu, Y.Zhang, Q.Huang, and R.Pless, "Minimum power configuration for wireless communication in sensor networks," ACM Trans. on Sensor Networks, vol. 3, pp.200-233, 2007.
[6] K.Chakrabarty, S.S. Iyegar, H..Qi, and E.Cho, "Grid coverage for surveillance and target location in distributed sensor networks," IEEE Trans. on Computers, vol. 51, pp.1448-1453, December 2002.
[7] G.Wang, G.Cao, T.LaPorta, and W.Zhang, "Sensor relocation in mobile sensor networks," IEEE INFOCOM, vol. 4, pp.2302-2312, March 2005.
[8] S.Meguerdichian, F.Koushanfar, M.Potkonjak, and M.B.Srivastava, "Coverage problems in wireless ad-hoc sensor networks," IEEE INFOCOM, vol. 3, pp.1380-1387, 2001.
[9] S.Balasubramanian and D.Aksoy, "Adaptive energy-efficient registration and online scheduling for asymmetric wireless sensor networks," Computer Networks, vol. 51, pp.3427-3447, August 2007.
[10] G.Wang, G.Cao, and T.L.Porta, "Movement-assisted sensor deployment," IEEE INFOCOM, vol. 4, pp.2469-2479, 2004.
[11] M.Transier et al., "A hierarchical approach to position-based multicast for mobile ad-hoc networks," Splinger Science Business Media, pp.447-460, 2007.
[12] I.G.Siqueira, L.B.Ruiz, A.A.F.Loureiro, and J.M.Nogueira, "Coverage area management for wireless sensor networks," Int. J. Network Mgmt, vol. 17, pp.17-31, January 2007.
[13] S.Meguerdician, F.Koushanfar, G.Qu, and M.Potkonjak, "Exposure in wireless ad-hoc sensor networks," MOBICOM, pp.139-150, July 2001.
[14] T.Clouqueur, V.Phipatanasuphorn, P.Ramanathan, and K.K.Saluja, "Sensor deployment strategy for target detection," First ACM International Workshop on Wireless Sensor Networks and Application, pp.42-48, 2002.
[15] H-T.Pai and Y.S.Han, "Power-efficient direct-voting assurance for data fusion in wireless sensor networks," IEEE Trans. on Computers, vol. 57, pp.261-273, February 2008.
[16] Y.Zou and K.Chakrabarty, "Sensor deployment and target localization based on virtual forces," IEEE INFOCOM, vol. 2, pp.1293-1303, April 2003.
[17] C.Perkins, E.Belding-Royer, and S.Das, "Ad hoc on-demand distace vector (aodv) routing," RFC3561, 2003.