Open Access Open Access  Restricted Access Subscription or Fee Access

Improving LLEAP Performance by Determining Sufficient Number of Uniformly Distributed Sensor Nodes

Basma M. Mohammad El-Basioni, Sherine M. Abd El-kader, Hussein S. Eissa

Abstract


As selecting an appropriate number of nodes before
Wireless Sensor Network deployment is important and it is difficult and inefficient to be done by simulation, a method for achieving that is requisite. This paper represents a performance modification to the Low Loss Energy_Aware routing Protocol (LLEAP) by developing a new algorithm consists of simple mathematical equations for determining the suitable number of nodes for Wireless Sensor Network applications’ deployments and applying it to LLEAP network such that the essential node redundancy in Wireless Sensor
Network could be exploited such that a good behavior with respect to lifetime, accuracy, fault tolerance, coverage, and connectivity are attained. Also this paper proposes a coverage method suitable to theproposed nodes’ number determination method and applies it to the LLEAP protocol to test its performance. The simulation results show that the modified protocol, which is the Adaptive Low Loss Energy_Aware routing Protocol (ALLEAP), improves LLEAP in terms of lifetime and throughput by on average 22.34% and 40.7% respectively, and the delay is decreased only by about 2.1%, so the
modified protocol (ALLEAP) is better for the applications that require long lifetime and are tolerable to delay.


Keywords


Coverage, Fault Tolerance, LLEAP, Node Redundancy, Wireless Sensor Network

Full Text:

PDF

References


F. Akyildiz, Wireless Sensor Networks, Series in Communications and Networking. John Wiley & Sons Ltd., 2010

S. Misra, I. Woungang, and S. C. Misra, Guide to Wireless Sensor Networks. London: Springer-Verlag, 2009.

A. A. Hady, S. M. Abd El-kader, H. S. Eissa, A. Salem, and H. M.A. Fahmy, “A Comparative Analysis of Hierarchical Routing Protocols in Wireless Sensor Networks,” in Internet and Distributed Computing Advancements: Theoretical Frameworks and Practical Applications, J. H. Abawajy, M. Pathan, M. Rahman, A. K. Pathan, and M. M. Deris, Ed. IGI

Global, 2012, pp. 212-246.

S. M. Abd El-kader and H. S. Eissa, “Sufficient Number Of Uniform Distributed Wireless Sensors,” The Egyptian Computer Journal, Institute of Statistical Studies and Research (ISSR), Cairo University, Cairo, Egypt, vol. 33, , pp. 70-83, June 2005- June 2006.

B. M. Mohammad El-Basioni, S. M. Abd El-kader, H. S. Eissa, and M. M. Zahra, “An Optimized Energy-aware Routing Protocol for Wireless Sensor Network,” Egyptian Informatics Journal, vol. 12, no. 2, pp. 61–72, July 2011.

B. M. Mohammad El-Basioni, S. M. Abd El-kader, H. S. Eissa, and M. M. Zahra, “Performance Evaluation of an Energy-Aware Routing Protocol for Wireless Sensor Networks”, M.S. thesis, Dept. Electrical Eng., Faculty of Engineering, Al-Azhar University, 2011.

F. Christy and V. R. Dhulipala, “Analysis of Selective Routing Strategies for Fault Tolerance In Wireless Sensor Networks,” International Journal on Computer Science and Engineering, vol. 4, no. 5, pp. 749-755, May 2012.

G. Cugola and M. Migliavacca, “A Context and Content-Based Routing Protocol for Mobile Sensor Networks,” in Proc.6th European Conference on Wireless Sensor Networks (EWSN '09), Springer-Verlag Berlin, Heidelberg, 2009, pp. 69 – 85.

N. Ahmed, Y. Dong, S. S. Kanhere, S. Jha, M. Rutten, T. Bessell, and N. Gordon, “Performance Evaluation of a Wireless Sensor Network Based Tracking System,” in Proc. 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, 2008, pp. 163 - 172

Z. Yang, Y. Yong, and J. He, “Determining the Number of Nodes for

Wireless Sensor Networks,” in Proc. 6th IEEE CAS Symp. on Emerging Technologies: Mobile and Wireless Comm, Shanghai, China, 2004, pp. 501-504

A. Parikh, H.Joshi, L. Xing, V. M. Vokkarane, and H. Liu, “Optimizing Sensor Count in Layered Wireless Sensor Networks,” International Journal of Performability Engineering, vol. 5, no. 3, pp. 296-298, 2009.

H. Zhang and J.C. Hou, “Maintaining scheme coverage and connectivity in large sensor networks,” in Proc. NSF International Workshop on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc wireless, and Peer-to-Peer Networks, 2004.

X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless, and C.D. Gill, “Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks,” in Proc. 1st International Conference on Embedded Networked Sensor Systems, ACM Press, 2003, pp 28-39.

M. Liu, J. Cao, W. Lou, L.-j. Chen , and X. Li, Coverage Analysis for Wireless Sensor Networks. Berlin Heidelberg: Springer-Verlag , 2005, pp. 711 – 720.

M. Liu, J. Cao, Y. Zheng, H. Gong, and X. Wang, “An energy-efficient protocol for data gathering and aggregation in wireless sensor networks,”

J Supercomput, vol. 43, pp. 107–125, 2008.

M. Liu, J. Cao, H.-g. Gong, L.-j. Chen, and X. Li, Distributed Power-Efficient Data Gathering and Aggregation Protocol for Wireless Sensor Networks. Berlin Heidelberg: Springer-Verlag, 2005, pp. 743 – 756.

M. Liu, J. Cao, G. Chen, and X. Wang, “An energy-aware routing protocol in wireless sensor networks,” Journal of Sensors, vol. 9, no. 1, pp. 445–462, 2009.

H. Gong, M. Liu, Y. Mao, L. Chen, and L. Xie, “Distributed Energy Efficient Data Gathering with Intra-cluster Coverage in Wireless Sensor Networks,” in Proc. 8th Asia-pacific Web Conf. (APWeb), vol. 3841, Harbin, China, Jan. 2006, pp. 109-120.

A. Varga, “Omnet++ discrete event simulation system (Version 3.2),” the Technical University of Budapest, Department of Telecommunications (BME-HIT), retrieved from

http://www.omnetpp.org/omnetpp/doc_details/2105-omnet-32-win32-binary-exe.

M. Hefeeda and H. Ahmadi, “A Probabilistic Coverage Protocol for Wireless Sensor Networks, ” in Proc. IEEE International Conference on Network Protocols (ICNP'07), Beijing, China, Oct. 2007, pp. 41-50.

J. Ai and A. A. Abouzeid, “Coverage by directional sensors in randomly deployed wireless sensor networks,” Journal of Combinatorial Optimization, vol. 11, no. 1, pp.21–41, Feb. 2006.

C. Zhang, Y. Zhang, and Y. Fang, “Localized algorithms for coverage boundary detection in wireless sensor networks,” Wireless networks, vol. 15, no. 1, pp. 3–20, 2009.

N. Ahmed, S. S. Kanhere, and S. Jha, “Probabilistic Coverage in Wireless Sensor Network,” in Proc . IEEE Conference on Local Computer Networks (LCN’05), 2005, pp. 672-681.

C. Zhang, Y. Zhang, and Y. Fang, “Detecting coverage boundary nodes in wireless sensor networks,” in Proc . IEEE International Conference on Networking, Sensing and Control (ICNSC ’06), Fort Lauderdale, Florida, USA, 2006, pp. 868-873.

Y. Bejerano,“Simple and efficient k-coverage verification without location information,” in Proc . Infocom’08, , Phoenix, Arizona, U.S.A., 2008, pp. 897-905.

G. S. Kasbekar, Y. Bejerano, and S. Sarkar, “Lifetime and coverage guarantees through distributed coordinate-free sensor activation,” in Proc. 15th annual international conference on Mobile computing and networking(Mobicom’09), ACM New York, NY, USA, 2009, pp.169–180.

R. Ghrist and A. Muhammad, “Coverage and hole-detection in sensor networks via homology,” in Proc. 4th International Conference on Information Processing in Sensor Networks (IPSN05), 2005, pp. 254–260.

F. Yan, P. Martins, and L. Decreusefond, “Connectivity-based Distributed Coverage Hole Detection in Wireless Sensor Networks,” in Proc. Global Telecommunications Conference (GLOBECOM 2011),2011, pp. 1 –6.

Z. Abrams, A. Goel, and S. Plotkin, "Set k-cover algorithms for energy efficient monitoring in wireless sensor networks," in Proc. 3rd international symposium on Information processing in sensor networks, Berkeley, California, USA: ACM, 2004, pp. 424-432.

D. Tian and N.D. Georganas, “Location and Calculation-free Node-scheduling Schemes in Large Wireless Sensor Networks,” Ad Hoc Networks, vol. 2, no. 1, 2004, pp. 65-85.

F. Ye, G. Zhong, S. Lu, and L. Zhang, “PEAS: A Robust Energy Conserving Protocol for Long-Lived Sensor Networks,” in Proc. 23th IEEE International Conference on Distributed Computing Systems, (ICDCS '03), 2003, pp. 28-37.

B. Xi-rong, Z. Shi, X. Dingyu, L. Ning, “An Improved Centralized Voronoi Tessellation Algorithm for Wireless Sensor Network Coverage Problem,” Information and Contro1, no. 5, 2009, pp. 620-623.

H. Zhang and J. C. Hou, “Maintaining sensing coverage and connectivity in large sensor networks,” in Proc. Int. Workshop on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless and Peer-to-Peer Networks (AlgoSensors’04), Florida, Feb. 2004, pp. 89-124.

M. Cardei and D.-Z. Du, “Improving Wireless Sensor Network Lifetime through Power Aware Organization,” ACM Wireless Networks, vol. 11, no. 3, May 2005, pp. 333-340.

M. Cardei, M. Thai, L. Yingshu, and W. Weili, “Energy-efficient target

coverage in wireless sensor networks,” in Proc. 24th Annual Joint

Conference of the IEEE Computer and Communications

Societies(INFOCOM ‘5), March 2005, pp. 1976- 1984.

M. Hefeeda and M. Bagheri, “Randomized k-coverage algorithms for dense sensor networks,” in Proc. 26th IEEE International Conference on Computer Communications (INFOCOM 2007), Anchorage, AK, May 2007, pp. 2376–2380.

H. Ammari and J. Giudici, “On the Connected k-Coverage Problem in Heterogeneous Sensor Nets: The Curse of Randomness and Heterogeneity,” in Proc. 29th IEEE International Conference on Distributed Computing Systems, June 2009, pp. 265-272.

Habib M. Ammari and Sajal K. Das, “ On the Design of k-Covered Wireless Sensor Networks: Self- versus Triggered Sensor Scheduling,” in Proc. IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks & Workshops (WoWMoM 2009), June 2009, pp.1-9.

M. Lehsaini, H. Guyennet, and Mohammed Feham, “Cluster-based Energy-efficient k-Coverage for Wireless Sensor Networks,” Network Protocols and Algorithms, vol. 2, no. 2, 2010, pp. 89-106

J. Sheu, S. Tu, and C. Yu, “A Distributed Query Protocol in Wireless Sensor Networks,” Wireless Personal Communication, vol. 41, no. 4, June 2007, pp. 449-464.

D. Li, J Cao, D. Liu, Y. Yu, H. Sun, “Algorithms for the m-coverage Problem and k-connected m-Coverage Problem in Wireless Sensor Networks,” Lecture Notes in Computer Science, vol. 4672, Network and Parallel Computing, 2007, pp. 250-259.

S.-Y. Wang, K.-P. Shih, Y.-D. Chen, and H.-H. Ku, “Preserving Target Area Coverage in Wireless Sensor Networks by Using Computational Geometry ,” in Proc. IEEE Wireless Communications and Networkin Conference (WCNC), Apr. 2010, pp. 1-6.

B. Liu, P. Brass, O. Dousse, P. Nain, and D. Towsley, “Mobility improves coverage of sensor networks,” in Proc . 6th ACM international symposium on Mobile ad hoc networking and computing (MobiHoc’05), New York, NY, USA, 2005, pp. 300–308.

A. sekhar, B. S. Manoj, and C. S. R. Murthy, “Dynamic Coverage Maintenance Algorithms for Sensor Networks with Limited Mobility,” in Proc. International Conference on Computing and Communication, March 2005, pp. 51-60.

T. P. Lambrou, C. G. Panayiotou, S. Felici, and B. Beferull, “Exploiting Mobility for Efficient Coverage in Sparse Wireless Sensor Networks,” Wireless Personal Commun., vol. 54, no. 1, Apr. 2009, pp. 187-201.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.