April 2020: Top Read Articles in Wireless & Mobile Networks
April 2020: Top Read Articles in Wireless & Mobile Networks
Read Articles in
Wireless & Mobile
Networks
ABSTRACT
Localization is an important feature in Wireless sensor networks (WSNs). Accuracy in
node localization with proper synchronization and required localization of sensor nodes,
save node energy and enhance the performance of communication network protocols. In
this paper we propose distributed localization algorithms and assume position known
Cluster Head (CH) and position unknown three beacon nodes for each cluster. Using
trilateration technique beacon nodes are located. Additional beacon node is added to
confirm the location of beacon nodes and maintain location accuracy. These position
localized beacon nodes help to locate other sensor nodes. The proposed two distributed
zone based localization algorithms are (i) Horizontal Location Position System (H-LPS),
where cluster is divided into Horizontal Zones (HZs) and beacon nodes locate in
horizontal direction and (ii) Vertical Location Position System (V-LPS), where cluster
is divided into Vertical Zones (VZs) and beacon nodes locate in vertical direction. The
main advantage of zone based localization is nodes belonging to a bounded zone
(horizontal or vertical) are localized and participate in WSN computing. If a bounded
zone is eliminated during localization, then nodes do not participate in localization and
thus save WSN computing. We provide zone based simulations for H-LPS and V-LPS
in comparison with existing localization algorithms like Ad hoc Positioning System
(APS), Recursive Positioning Estimation (RPE) and Directed Positioning Estimation
(DPE). Performance evaluation of H-LPS and V-LPS illustrate that for zone based
localization, H-LPS and V-LPS perform better that existing localization techniques.
Bounded zone performance is optimal for H-LPS and V-LPS compared to existing
localization techniques in WSN.
KEYWORDS
[1] Guoqiang Mao and Baris Fidan (2009), “Localization Algorithms and Strategies for
Wireless Sensor Networks”, Information Science Reference (Imprint of IGI Global), UK.
[2] Masoomeh Rudafshani and Suprakash Datta (2007), “Localization in Wireless Sensor
Networks”,
IPSN’07, April 2007, pp. 51-60.
[3] Guoqiang Mao, Barıs Fidan and Brian D.O. Anderson (2007), “Wireless sensor network
localization techniques”, Elsevier Computer Networks, 2007 Volume 51, pp. 2529-2553.
[4] Azzedine Bouerche, Horacio A.B.F.Oliveira, Eduardo F.Nakamura and Antonio
A.F.Loureiro (2007), “Localization Systems for Wireless Sensor Networks”, IEEE Wireless
Communication Magazine, December 2007, pp. 6-12.
[5] L. Doherty, K. S. J. Pister, and L. El Ghaoui (2001), “Convex position estimation in
wireless sensor networks”, Proceedings of IEEE INFOCOM, volume 3, April 2001, pp. 1655
– 1663.
[6] Y. Shang, W. Ruml, Y Zhang, and M. Fromherz (2004), “Localization from connectivity
in sensor networks”, IEEE Transactions on Parallel and Distributed Systems, no. 11,
volume 15, pp. 961 – 974.
[7] C. Savarese, J. M. Rabaey, and J. Beutel (2001), “Location in distributed ad - hoc
wireless sensor networks”, Proceedings of 2001 International Conference on Acoustics,
Speech, and Signal Processing (ICASSP ’01), May 2001, pp. 2037 – 2040.
[8] Gwo-Jong Yu and Shao-Chun Wang (2008), “A Hierarchical MDS-based Localization
Algorithm for Wireless Sensor Networks”, Journal of Information Technology and
Applications, 2008, Volume 2, No. 4, pp. 197-202.
[9] Cesare Alippi, Giovanni Vanini (2006), “A RSSI-based and calibrated centralized
localization technique for Wireless Sensor Networks”, Proceedings of Fourth IEEE
International Conference on Pervasive Computing and Communications Workshops
(PERCOMW’06), March 2006, pp. 301-305.
[10] J. Albowicz, A. Chen, and L. Zhang (2001), “Recursive position estimation in
sensor networks”,
The 9th International Conference on Network Protocols, November 2001, pp. 35–41.
[11] D. Niculescu and B. Nath (2001), “Ad - hoc positioning system”, Proceedings
of 2001 IEEE Global Communications Conference (Globecom ’ 2001), November 2001, pp.
2926 – 2931.
[12] C. Savarese, K. Langendoen, and J. Rabaey (2002), “Robust positioning
algorithms for distributed ad-hoc wireless sensor networks”, Proceedings of USENIX
Technical Annual Conference, 2002, pp. 317 – 328.
[13] Peng Aiping, Guo Xiaosong, Cai Wei, Li Haibin, (2009) "A Distributed
Localization Scheme for Wireless Sensor Networks Based on Bounding Box Algorithm",
IEEE The Ninth International Conference on Electronic Measurement & Instruments
(ICEMI’2009), pp. 984-988.
[14] T. He, C. Huang, B. Blum, J. Stankovic, and T. Abdelzaher (2003), “Range-Free
Localization Schemes in Large Scale Sensor Networks”, Proceedings of the Ninth Annual
international conference on Mobile computing and networking (MobiCom 2003), pp. 81 –
95.
[15] H. A. B. F. Oliveira, E. F. Nakamura, A. A. F. Loureiro, and A. Boukerche
(2005), “Directed position estimation: A recursive localization approach for wireless sensor
networks”, Proceedings of the 14th IEEE International Conference on Computer
Communications and Networks (IC3N ’05), October 2005, pp. 557–562.
[16] Azzedine Boukerche (2009), "Algorithms and Protocols for Wireless Sensor
Networks", John Wiley & Sons, Inc., New Jersey, USA.
[17] Amitangshu Pal (2010), "Localization Algorithms in Wireless Sensor Networks:
Current Approaches and Future Challenges", Network Protocols and Algorithms, Volume 2,
No. 1.
[18] Sheng-Shih Wang, Kuei-Ping Shih and Chih-Yung Chang (2007), "Distributed
direction-based localization in wireless sensor networks”, Elsevier Computer
Communications, Volume 30, 2007, pp. 1424-1439.
[19] Lei Zhang and Binwei Deng (2009), "A New Range-based Localization
Algorithm for Wireless Sensor Networks", International Colloquium on Computing,
Communication, Control, and Management (CCCM 2009), pp. 111-114.
[20] Nirupama Bulusu,John Heidemann, Deborah Estrub and Tommy Tran
(2004),"Self-Configuring Localization Systems:Design and Experimental Evaluation",
ACM Transactions on Embedded Computing Systems, Vol. 3, No. 1, February 2004, pp.
24–60.
[21] J. A. Costa , N. Patwari , and A. O. Hero (2006) , “ Distributed weighted –
multidimensional scaling for node localization in sensor networks”, ACM Transactions on
Sensor Networks (TOSN) , volume 2 no. 1, February 2006, pp. 39 – 64.
[22] M. L. Sichitiu and V. Ramadurai (2004), “Localization of wireless sensor
networks with a mobile beacon”, Proceedings of the 1st IEEE International Conference on
Mobile Ad Hoc and Sensor Systems (MASS 2004), October 2004, pp. 174–183.
AUTHOR BIOGRAPHIES
Abstract— Some WSN by a lot of immobile node and with the limited energy and
without further charge of energy. Whereas extension of many sensor nodes and their
operation. Hence it is normal.unactive nodes miss their communication in network,
hence split the network. For avoidance split of network, we proposed a fault recovery
corrupted node and Self Healing is necessary. In this Thesis, we design techniques to
maintain the cluster structure in the event of failures caused by energy-drained nodes.
Initially, node with the maximum residual energy in a cluster becomes cluster heed and
node with the second maximum residual energy becomes secondary cluster heed. Later
on, selection of cluster heed and secondary cluster heed will be based on available
residual energy. We use Matlab software as simulation platform quantities. like, energy
consumption at cluster and number of clusters is computed in evaluation of proposed
algorithm. Eventually we evaluated and compare this proposed method against previous
method and we demonstrate our model is better optimization than other method such as
Venkataraman, in energy consumption rate.
[4] L. Paradis and Q. Han, “A Survey of Fault Management in Wireless Sensor Networks”,
Journal of Network and Systems Management, vol. 15, no. 2, pp. 171-190, 2007.
[5] L. M. S. D. Souza, H. Vogt and M. Beigl, “A survey on fault tolerance in wireless sensor
networks”, 2007.
[8] G. Gupta and M. Younis; Fault tolerant clustering of wireless sensor networks; WCNC’03,
pp. 1579.1584.
[9] M. Ding, D. Chen, K. Xing, and X. Cheng, “Localized fault-tolerant event boundary
detection in sensor networks”, in Proceedings of the 24th Annual Joint Conference of the
IEEE Computer and Communications Societies (INFOCOM '05), vol. 2, pp. 902–913,
Miami, Fla, USA, March 2005
[11] S. Chessa and P. Santi, “Crash faults identification in wireless sensor networks”, Comput.
Commun., 2002, 25, (14), pp. 1273-1282.
[13] GUPTA G., YOUNIS M.: ‘Fault-tolerant clustering of wireless sensor networks’. Proc.
IEEE WCNC, New Orleans, USA,March 2003, vol. 3, p. 1579 – 1584
[14] N. Bulusu, J. Heidemann and D. Estrin, ”GPS-less Low Cost Outdoor Localization For Very
Small Devices”, IEEE Personal Communications, Special Issue on "Smart Spaces and
Environments", Vol. 7, No. 5, pp. 28-34, October 2000.
[15] Radhika Nagpal, ”Organizing a Global Coordinate System from Local Information on an
Amorphous Computer”, MIT AI Memo 1666, August 1999
Authors
1. Abolfazl Akbari
B.S in Computer Engineering, Science & Technology University, Iran,
Babol.
M.S. in Computer Engineering, Islamic Azad University Science And
Research Branch Iran, Tehran.
3. Ahmad Khademzadeh
Education and National Scientific and International Scientific
Cooperation Department, Iran Telecom Research Canter, Tehran, Iran
4. Neda Beikmahdavi
AN ENHANCED HYBRID ROUTING AND
CLUSTERING TECHNIQUE FOR WIRELESS SENSOR
NETWORK
Hasan Al-Refai
ABSTRACT
Wireless Sensor Networks (WSN) have extensively deployed in a wide range of applications.
However, WSN still faces several limitations in processing capabilities, memory, and power supply
of sensor nodes. It is required to extend the lifetime of WSN. Mainly this is achieved by routing
protocols choosing the best transmission path in-network with desired power conservation.This
cause is developing a generic protocol framework for WSNa big challenge. This work proposed a
new routing technique, described as Hybrid Routing-Clustering (HRC) model. This new approach
takes advantage of clustering and routing procedures defined in K-Mean clustering and AODV
routing, which constituted of three phases. This development aims to achieve enhanced power
conservation rate in consequence network lifetime. An extensive evaluation methodology utilized to
measure the performance of the proposed model in simulated scenarios.The results categorized in
terms of the average amount of packet received and power conservation rate. The Hybrid Routing-
Clustering (HRC) model was determined, showed enhanced results regarding both parameters. In
the end, they are comparing these results with well-known routing and well-known clustering
algorithms.
KEYWORDS
Wireless Sensor Networks, Clustering, Routing, Power conservation, Network lifetime, AODV, K-
Mean, LEACH
ABSTRACT
Wireless sensor networks are currently the greatest innovation in the field of
telecommunications. WSNs have a wide range of potential applications, including security
and surveillance, control, actuation and maintenance of complex systems and fine-grain
monitoring of indoor and outdoor environments. However security is one of the major
aspects of Wireless sensor networks due to the resource limitations of sensor nodes. Those
networks are facing several threats that affect their functioning and their life. In this paper we
present security attacks in wireless sensor networks, and we focus on comparison and
analysis of recent Intrusion Detection schemes in WSNs.
KEYWORDS
Wireless sensor Networks, Security, attack, Denial of Service (DoS), Intrusion Detection
Systems (IDS), IDS Architectures, Cluster-based IDS, Anomaly-based IDS, Signature based
IDS&Hybrid IDS
[1] Gang Zhao, “Wireless Sensor Networks for Industrial Process Monitoring and
Control: A Survey”, Network Protocols and Algorithms, ISSN 1943-358, Vol. 3, No. 1,
2011.
[2] G. Padmavath, D. Shanmugapriya, “A Survey of Attacks, Security Mechanisms and
Challenges in Wireless Sensor Networks”, (IJCSIS) International Journal of Computer
Science and Information Security, Vol. 4, No. 1 & 2, 2009.
[3] QusayIdreesSarhana, “Security Attacks and Countermeasures for Wireless Sensor
Networks: Survey”, International Journal of Current Engineering and Technology ISSN
2277 – 4106, June 2013.
[4] Z. BENENSON, M. CHOLEWINSKI, C. FREILING, “Vulnerabilities and Attacks
in Wireless Sensor Networks”, Laboratory for Dependable Distributed Systems, University
of Mannheim, 68131 Mannheim, Germany, 2010
[5] E.Çayırcı and C.Rong ,“Security in Wireless Ad Hoc and Sensor Networks”, ISBN:
978-0-470- 02748-6, 2009.
[6] P. Mohanty, S. Panigrahi, N. Sarma and S. Satapathy, “Security issues in wireless
sensor network data gathering protocols: a survey”, Department of Computer Science and
Engineering Tezpur University, Tezpur, India 2010.
[7] Q. IdreesSarhan, “Security Attacks and Countermeasures for Wireless Sensor
Networks: Survey”, International Journal of Current Engineering and Technology, 2013.
[8] A.Singla, R. Sachdeva, “Review on Security Issues and Attacks in Wireless Sensor
Networks”, International Journal of Advanced Research in Computer Science and Software
Engineering, Volume 3, Issue 4, April 2013.
[9] V. Soni1, P.Modi, V.Chaudhri, “Detecting Sinkhole Attack in Wireless Sensor
Network”, International Journal of Application or Innovation in Engineering & Management,
Volume 2, Issue 2, February 2013.
[10] K. Sharma, M.Ghose, “Wireless Sensor Networks: An Overview on its
Security Threats”, IJCA Special Issue on “Mobile Ad-hoc Networks” MANETs, 2010.
[11] K. Sun, P. Peng, P. Ning, and C. Wang, “Secure Distributed Cluster
Formation in Wireless SensorNetworks”,in Proceedings of the 22nd AnnualComputer
Security Applications Conference (AC-SAC’06), Pages: 131-140, December 2006.
[12] A. Wood and J. Stankovic, “Denial of service insensornetworks”,IEEE Computer,
pages 5462,October 2002.
[13] Ullah, Fasee, “Analysis of security protocols for Wireless Sensor Networks”, Dept.
of Comput. Sci., City Univ. of Sci. & Inf. Technol., Peshawar, Pakistan, Computer Research
and Development (ICCRD), 2011.
[14] A. Perrig, R. Szewczyk, J.D Tygar, V. Wen abd D. Culler, “SPINS:Security
Protocols f or Sensor Networks”, Departement of electrical engineering and Computer
Scinces, University of California, Berkley, USA 2002.
[15] J. Deng, R. Han, S. Mishra, “INSENS: Intrusion-Tolerant Routing in Wireless
Sensor Networks”, University of Colorado, Department of Computer Science, 2002.
ABSTRACT
A critical need in Mobile Wireless Sensor Network (MWSN) is to achieve energy efficiency
during routing as the sensor nodes have scarce energy resource. The nodes’ mobility in
MWSN poses a challenge to design an energy efficient routing protocol. Clustering helps to
achieve energy efficiency by reducing the organization complexity overhead of the network
which is proportional to the number of nodes in the network. This paper proposes a novel
hybrid multipath routing algorithm with an efficient clustering technique. A node is selected
as cluster head if it has high surplus energy, better transmission range and least mobility.
The Energy Aware (EA) selection mechanism and the Maximal Nodal Surplus Energy
estimation technique incorporated in this algorithm improves the energy performance during
routing. Simulation results can show that the proposed clustering and routing algorithm can
scale well in dynamic and energy deficient mobile sensor network.
KEYWORDS
Mobile Wireless Sensor Network, Energy Efficiency, Surplus Energy, Clustering.
[20] U.Lee, E.O. Magistretti, B.O. Zhou, M. Gerla, P. Bellavista, A. Corradi, Efficient
data harvesting in mobile sensor platforms, PerCom Workshops, pp. 352–356, 2006.
[21] Lynn Choi, Jae Kyun jung, Byong –Ha Cho and Hyohyun Choi, “ M- Geocast :
Robust And Energy Efficient Geometric Routing For Mobile Sensor Networks” in
the proceedings of IFIP International Federation for information Processing 2008;
SEUS 2008, LNCS 5287, pp. 304-316.
[22] Chuan-Ming Liu, Chuan-Hsiu Lee, Li-Chun Wang (2007),: Distributed Clustering
algorithms for data gathering in mobile wireless sensor networks” in the Journal of
parallel and Distributed Computing, 67(2007), pp- 1187-1200.
[23] F.D Tolba, D.Magoni and P. Lorenz, :Connectivity, Energy and mobility driven
Weighted Clustering Algorithm, in the proceedings of IEEE GLOBECOM 2007.
[24] www.mwrf.com/Article/ArticleID/19915/19915.html
[25] Byung-Jae, Nah-Oak SONG, Leonard E. MILLER,: Standard Measure of Mobility for
Evaluating Mobile Adhoc Network performance, in the IEICE Trans. Commun, Vol.
E86-B, No. 11, November 2003, pp. 3236-3243.
[27] Dongkyun Kim, J.J. Garcia Luna Aceves, Katia Obraczka, Juan Carlos Cano and
Pietro Manzoni. : Routing Mechanism for Mobile Ad Hoc Networks Based on the
Energy Drain Rate, in the IEEE transactions on Mobile Computing, Vol.2, No.2, April-
June 2003, pp: 161-173.
Authors
Getsy S Sara is currently a Ph.D candidate Anna University Chennai, India. She
received her B.E degree with distinction in Electronics & Communication from
Bharathiar University, India in 2004 and M.E degree with distinction in Digital
Communication Engineering from Anna University, India in 2006. Her research
interests include wireless ad hoc networking, sensor networks, energy efficient
routing protocols and communication systems.
Kalaiarasi R is currently doing her Ph.D degree at Anna University Chennai, India.
She received her MCA degree from Madras University, Chennai. Her research
interests include MANET, sensor network, mobile computing and network security.