Open Access Open Access  Restricted Access Subscription or Fee Access

Improving the Security and Routing Performance of Wireless Sensor Networks

E.S. Selvakumar, M. NizarAhamed

Abstract


In wireless sensor networks (WSNs) point-to-point routing successfully employed by geographic routing, which assumes that a packet can be moved closer to the destination in the network topology. This assumption, however, may lead packets to the local minimum where no neighbors of the sender are closer to the destination or low quality routes that comprise long distance hops of low packet reception ratio. To address the local minimum problem, we propose a topology aware routing (TAR) protocol that efficiently encodes a network topology into a low-dimensional virtual coordinate space where hop distances between pair wise nodes are preserved and also we improve routing quality by embedding a network topology based on the metric of expected transmission count (ETX). Further, we investigate the facts of ensuring secure sensed data in a balanced energy network backbone, and propose energy-efficient secure path algorithm (ESPA) for WSNs. It is a process of ensuring sensed data authenticity and integrity under a well-structured energy efficient routing.

Keywords


Sensor Networks, Routing, Link Quality, Topology Embedding, and Sensor Nodes

Full Text:

PDF

References


M. Li and Y. Liu, “Rendered path: range-free localization inanisotropic sensor networks with holes,” Proceedings of theACM MobiCom, Published in IEEE/ACM Transactions on Networking(TON), vol. 18, no. 1, pp. 320–332, 2010.

P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, “Routing withGuaranteed Delivery in Ad Hoc Wireless Networks,” ACM Wireless Networks, vol. 7, no. 6, pp. 609-616, 2001.

B. Karp and H.T. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks,” Proc. MobiCom, 2000.

F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger, “GeometricAd-Hoc Routing: Of Theory and Practice,” Proc. Ann. Symp.Principles of Distributed Computing (PODC),2003.

H. Frey and I. Stojmenovic, “On Delivery Guarantees of Face andCombined Greedy-Face Routing in Ad Hoc and Sensor Networks,”Proc. MobiCom, pp. 390-401, 2006.

S. Shenker, S. Ratnasamy, B. Karp, R. Govindan, and D. Estrin,“Data-Centric Storage in Sensornets,” ACM SIGCOMM ComputerComm. Rev., vol. 33, no. 1, pp. 137-142, 2003.

Z. Zhong and T. He, “Achieving Range-Free Localization beyondConnectivity,” Proc. ACM Conf. Embedded Networked Sensor Systems(SenSys), 2009.

W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan,“Energy-efficient communication protocol for wireless sensornetworks,” in Proceedings of the The 33rd Annual Hawaii InternationalConference on System Siences (HICSS-33), pp. 1–10,Hawaii, USA, January 2000.

T. Camilo, C. Carreto, J. S´a Silva, and F. Boavida, “An energy-efficient ant base routing algorithm for wireless sensornetworks,” in Proceedings of the 5th International Workshop onAnt Colony Optimization and Swarm Intelligence (ANTS ’06),pp. 49–59, 2006.

K. Seada, M. Zuniga, A. Helmy, and B. Krishnamachari, “EnergyEfficient Forwarding Strategies for Geographic Routing in LossyWireless Sensor Networks,” Proc. Int’l Conf. Embedded NetworkedSensor Systems (SenSys), 2004.

S. Lee, B. Bhattacharjee, and S. Banerjee, “Efficient GeographicRouting in Multihop Wireless Networks,” Proc. ACM Int’l Symp.Mobile Ad Hoc Networking and Computing (MobiHoc), 2005.

E. Hamouda, N. Mitton, B. Pavkovic, and D. Simplot-Ryl, “Energy-Aware Georouting with Guaranteed Delivery in Wireless Sensor Networks with Obstacles,” Int. J. Wireless Information Networks, vol. 8, pp. 142-153, 2009.


Refbacks

  • There are currently no refbacks.


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