Open Access Open Access  Restricted Access Subscription or Fee Access

Energy Efficient Opportunistic Routing in Wireless Sensor Networks

J. Venkata Subramanian, A. Pandian, Maneesh Kumar Gupta

Abstract


The opportunistic routing has been shown to improve the network throughput, by allowing nodes that overhear the transmission and closer to the destination to participate in forwarding the packet, i.e., in forwarder list. In wireless networks, various factors, like fading, interference, and multi-path effects, can lead to temporary heavy packet losses in a pre-selected path The nodes in forwarder list are prioritized and the lower priority forwarder will discard the packet if the packet has been forwarded by a higher priority forwarder. One challenging problem is to select and prioritize forwarder list such that a certain network performance is optimized. The main focus is on selecting and prioritizing forwarder list to minimize energy consumptions by all nodes. The study of both cases where the transmission power of each node is fixed or dynamically adjustable. I present an energy efficient opportunistic routing strategy, denoted as EEOR. Here extensive simulations in TOSSIM show that the new implemented protocol EEOR performs better than the well-known ExOR protocol (when adapted in sensor networks) in terms of the energy consumption, the packet loss ratio, the average delivery delay

Keywords


Wireless Networks, Multi-Path Routing Protocols,Dynamic Wireless, TOSSIM

Full Text:

PDF

References


X.-F. Mao, X.-Y. Li, W.-Z. Song, P. Xu and K. Moaveni-Nejad Energy Efficient Opportunistic Routing in Wireless Networks In ACM MSWIM’ 09

Sanjit Biswas and Robert Morris. Exor: opportunistic multi-hop routingfor wireless networks. In SIGCOMM, pages 133–144, 2005.

S. Chachulski, M. Jennings, S. Katti, and D. Katabi. Trading structure for randomness in wireless opportunistic routing. In ACM SIGCOMM, 2007.

Qunfeng Dong, Suman Banerjee, Micah Adler, and Archan Misra. Minimum energy reliable paths using unreliable wireless links. In ACM MobiHoc, 449–459, 2005.

Robin Kravets and P. Krishnan. Power management techniques for mobile communication. In ACM MobiCom, 1998.

Johnson Kuruvila, Amiya Nayak, Ivan Stojmenovic. Hop count optimal position-based packet routing algorithms for ad hoc wireless networks with a realistic physical layer. IEEE JSAC, Vol. 23, No. 6, June 2005, 1267-1275.

Lewko, A. Sahai, B. Waters, ”Revocation Systems with Very Small Private Keys,” Proc. IEEE Symposium on Security and Privacy 2010, pp. 273–285, 2010.

Boldyreva, V. Goyal, V. Kumar, ”Identity-Based Encryption with Efficient Revocation,” Proc. ACM Conference on Computer and Communications Security 2008, pp. 417–426, 2008.

L. Ibraimi, M. Petkovic, S. Nikova, P. Hartel, W. Jonker, ”Mediated Cipher text- Policy Attribute-Based Encryption and Its Application,” Proc. WISA 2009, LNCS 5932, pp. 309–323, 2009.

L. Cheung, C. Newport, ”Provably Secure Ciphertext Policy ABE,” ACM Conference on Computer and Communications Security, pp. 456–465, 2007.

R. Agrawal, T. Imielinski, and A. Swami, “Mining Association Rules between Sets of Items in Large Databases,” Proc. ACM SIGMOD, vol. 22, no. 2, pp. 207-216, 1993.

N.B. Amor, S. Benferhat, and Z. Elouedi, “Naive Bayes vs. Decision Trees in Intrusion Detection Systems,” Proc. ACM Symp. Applied Computing (SAC ’04), pp. 420-424, 2004.

R. Bace and P. Mell, Intrusion Detection Systems, Computer Security Division, Information Technology Laboratory, Nat’l Inst. of Standards and Technology, 2001.

D. Boughaci, H. Drias, A. Bendib, Y. Bouznit, and B. Benhamou, “Distributed Intrusion Detection Framework Based on Mobile Agents,” Proc. Int’l Conf. Dependability of Computer Systems (DepCoS-RELCOMEX ’06), pp. 248-255, 2006.

Y.Bouzida and S. Gombault, “Eigenconnections to Intrusion Detection,” Security and Protection in Information Processing Systems, pp. 241-258, 2004.


Refbacks

  • There are currently no refbacks.


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