CFP last date
20 December 2024
Reseach Article

Energy Conservation in Tree-based Event Driven Wireless Ad-hoc Networks

by Itu Snigdh, Rumanshu
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 68 - Number 10
Year of Publication: 2013
Authors: Itu Snigdh, Rumanshu
10.5120/11618-7015

Itu Snigdh, Rumanshu . Energy Conservation in Tree-based Event Driven Wireless Ad-hoc Networks. International Journal of Computer Applications. 68, 10 ( April 2013), 34-39. DOI=10.5120/11618-7015

@article{ 10.5120/11618-7015,
author = { Itu Snigdh, Rumanshu },
title = { Energy Conservation in Tree-based Event Driven Wireless Ad-hoc Networks },
journal = { International Journal of Computer Applications },
issue_date = { April 2013 },
volume = { 68 },
number = { 10 },
month = { April },
year = { 2013 },
issn = { 0975-8887 },
pages = { 34-39 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume68/number10/11618-7015/ },
doi = { 10.5120/11618-7015 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:27:30.107414+05:30
%A Itu Snigdh
%A Rumanshu
%T Energy Conservation in Tree-based Event Driven Wireless Ad-hoc Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 68
%N 10
%P 34-39
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Wireless nodes communicate over wireless links that typically have less bandwidth than in a wired network. Each node in a wireless ad hoc network functions as both a host and a router, and the control of the network is distributed among the nodes. The network topology is in general, dynamic, as the connectivity among the nodes may vary with time because of node departures, new node arrivals, and the change of environments. Hence, there is a need for efficient routing protocols to allow the nodes to communicate over multihop paths. This paper focuses on the effect of topology that requires to be locally and self-adaptively maintained, at a low communication cost, without affecting QOS. The preliminary research shows the contrast of energy expedited in a tree based network over the usual graph based network employing directed diffusion. The method achieves lesser energy consumption owing to reduction of the no of bits though unicast communication and discarding other redundant messages arriving later, thereby constricting the network to have at most one transmission for one event.

References
  1. Lin, Fu, Zhang, Deng-Yi; Li, Wenhai," Research on Quality of Service in Wireless Sensor Networks", IEEE 2nd International Conference, 15- 17 July 2011
  2. C K Toh, "Ad Hoc Mobile Wireless Networks", Prentice Hall Publishers, 2002.
  3. P. Gupta and P. R. Kumar, "Capacity of wireless networks". IEEE Transactions on Information Theory, Volume 46, Issue 2, March 2000.
  4. Andrew S. Tanenbaum, "Computer Networks", third edition, Network series, Pearson Education India, 2008.
  5. Tony Lasson & Nicklas Hedman (1998) "Routing protocols in wireless Ad hoc network" Lulea University of technology, Stockholm.
  6. Lee Kok Thong (2004) "Performance analysis of mobile adhoc routing protocols" thesis Naval post graduate college, Monterey, California.
  7. M. Abolhasan, T. Wysocki, and E. Dutkiewicz, "A review of routing protocols for mobile ad hoc networks", Ad Hoc Networks, vol. 2, no. 1, pp. 1. 22, Jan. 2004.
  8. Niwat Thepvilojanapong, Yoshito Tobe, Kaoru Sezaki,"On the Construction of Efficient Data Gathering Tree in Wireless Sensor Networks", Circuits and Systems, 2005. ISCAS 2005. IEEE International Symposium, 23-26 May 2005.
  9. Perkins, Charles E. and Bhagwat, Pravin (1994) "Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers". Retrieved 2006-10-20.
  10. T. Clausen and P. Jacquet, "Optimized link state routing protocol (OLSR)", IETF, RFC 3626, Oct. 2003.
  11. D. B. Johnson, D. A. Maltz, and J. Broch, "DSR: The dynamic source routing protocol for multi-hop wireless ad hoc networks", in Ad Hoc Networking, C. E. Perkins, Ed. Addison-Wesley, 2001, pp. 139. 172.
  12. Perkins, C. ; Belding-Royer, E. ; Das, S. (July 2003), "Ad hoc On-Demand Distance Vector (AODV) Routing", IETF. RFC 3561. Retrieved 2010-06-18.
  13. Ying Zhang and Qingfeng Huang, "Adaptive Tree: A Learning-based Meta-Routing Strategy for Sensor Networks", Consumer Communications and Networking Conference, 2006, 3rd IEEE.
  14. Wang, Yongheng; Zhang, Xiaoming, "Internet of Things", Chapter - Optimized Clustering Tree Based Routing Protocol for Wireless Sensor Networks, Communications in Computer and Information Science Volume 312, 2012, pp 192-199.
  15. François Delobel, Alexandre Guitton, Michel Misson, Waltenegus Dargie: "Minimization of the Diffusion Delay of a Tree-Based Wireless Sensor Network". GLOBECOM 2011: 1-6.
  16. Mohammad Zeynali, Leili Mohammad Khanli, and Amir Mollanejad, "TBRP: Novel Tree Based Routing Protocol in Wireless Sensor Network", International Journal of Grid and Distributed Computing, Vol. 2, No. 4, December, 2009.
  17. Luca Borsani, Sergio Guglielmi, Alessandro Redondi, Matteo Cesana, "Tree-Based Routing Protocol for Wireless Sensor Networks", Wireless On-Demand Network Systems and Services (WONS), 2011 Eighth International Conference, 26-28 Jan. 2011.
  18. Jeremy Elson, Lewis Girod and Deborah Estrin, "Fine-Grained Network Time Synchronization using Reference Broadcasts", UCLA.
  19. Saurabh Ganeriwal, Ram Kumar, Mani B. Srivastava, "Timing-sync protocol for sensor networks", SenSys 2003: 138-149
  20. C. Intanagonwiwat, R. Govindan, and D. Estrin, "Directed diffusion: a scalable and robust communication paradigm for sensor networks", In Proc. of ACM MOBICOM, Aug. 2000, pp. 56. 67.
Index Terms

Computer Science
Information Sciences

Keywords

Adhoc network energy conservation routing tree based backbone structure