The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - June (2009 vol.58)
pp: 812-826
Kiran K. Rachuri , Indian Institute of Technology Madras, Chennai
C. Siva Ram Murthy , Indian Institute of Technology Madras, Chennai
ABSTRACT
In this paper, we consider the problem of information discovery in a densely deployed Wireless Sensor Network (WSN), where the initiator of search is unaware of the location of target information. We propose two protocols: Increasing Ray Search (IRS), an energy efficient and scalable search protocol, and k-IRS, an enhanced variant of IRS. The priority of IRS is energy efficiency and sacrifices latency whereas k-IRS is configurable in terms of energy-latency trade-off and this flexibility makes it applicable to varied application scenarios. The basic principle of these protocols is to route the search packet along a set of trajectories called rays that maximizes the likelihood of discovering the target information by consuming least amount of energy. The rays are organized such that if the search packet travels along all these rays, then the entire terrain area will be covered by its transmissions while minimizing the overlap of these transmissions. In this way, only a subset of total sensor nodes transmits the search packet to cover the entire terrain area while others listen. We believe that query resolution based on the principles of area coverage provides a new dimension for conquering the scale of WSN. We compare IRS and k-IRS with existing query resolution techniques for unknown target location such as Expanding Ring Search (ERS), Random walk search, and variants of Gossip search. We show by analysis, simulation, and implementation in testbed that IRS and k-IRS are highly scalable, the cost of search (total number of transmitted bytes) is independent of node density, and it is much lower than that of existing proposals under high node density.
INDEX TERMS
Wireless sensor networks, energy efficiency, scalability, search, querying, energy-latency trade-off.
CITATION
Kiran K. Rachuri, C. Siva Ram Murthy, "Energy Efficient and Scalable Search in Dense Wireless Sensor Networks", IEEE Transactions on Computers, vol.58, no. 6, pp. 812-826, June 2009, doi:10.1109/TC.2009.29
REFERENCES
[1] I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “A Survey on Sensor Networks,” IEEE Comm. Magazine, vol. 40, no. 8, pp.102-114, Aug. 2002.
[2] X. Liu, Q. Huang, and Y. Zhang, “Combs, Needles, Haystacks: Balancing Push and Pull for Discovery in Large-Scale Sensor Networks,” Proc. Second Int'l Conf. Embedded Networked Sensor Systems (SenSys '04), pp.122-133, Nov. 2004.
[3] R. Govindan, J. Hellerstein, W. Hong, S. Madden, M. Franklin, and S. Shenker, “The Sensor Network as a Database,” Technical Report 02-771, Computer Science Dept., Univ. of Southern California, Sept. 2002.
[4] J. Ahn and B. Krishnamachari, “Modeling Search Costs in Wireless Sensor Networks,” Technical Report CENG-2007-1, Computer Science Dept., Univ. of Southern California, 2007.
[5] N. Sadagopan, B. Krishnamachari, and A. Helmy, “The Acquire Mechanism for Efficient Querying in Sensor Networks,” Proc. First IEEE Int'l Workshop Sensor Network Protocols and Applications (SNPA '03), pp.149-155, May 2003.
[6] T.Q. Quek, D. Dardari, and M.Z. Win, “Energy Efficiency of Dense Wireless Sensor Networks: To Cooperate or Not to Cooperate,” IEEE J. Selected Areas in Comm., vol. 25, no. 2, pp.459-470, Feb. 2007.
[7] G. Halkes and K. Langendoen, “Crankshaft: An Energy-Efficient MAC-Protocol for Dense Wireless Sensor Networks,” Proc. Fourth European Conf. Wireless Sensor Networks (EWSN '07), pp.228-244, Jan. 2007.
[8] J. Cai, D. Ee, B. Pham, P. Roe, and J. Zhang, “Sensor Network for the Monitoring of Ecosystem: Bird Species Recognition,” Proc. Third Int'l Conf. Intelligent Sensors, Sensor Networks and Information (ISSNIP '07), pp.293-298, Dec. 2007.
[9] C.-E. Chen, A.M. Ali, and H. Wang, “Design and Testing of Robust Acoustic Arrays for Localization and Enhancement of Several Bird Sources,” Proc. Fifth Int'l Conf. Information Processing in Sensor Networks (IPSN '06), pp.268-275, Apr. 2006.
[10] Q. Wang, R. Zheng, A. Tirumala, X. Liu, and L. Sha, “Lightning: A Hard Real-Time, Fast, and Lightweight Low-End Wireless Sensor Election Protocol for Acoustic Event Localization,” IEEE Trans. Mobile Computing, vol. 7, no. 5, pp.570-584, May 2008.
[11] Crossbow MICAz Mote, http://www.xbow.com/Productsproductdetails.aspx?sid=164, 2009.
[12] Moteiv Tmote Sky Mote, http://www.sentilla.com/pdf/eoltmote-sky-datasheet.pdf , 2009.
[13] G. Werner-Allen, K. Lorincz, M. Welsh, O. Marcillo, J. Johnson, M. Ruiz, and J. Lees, “Deploying a Wireless Sensor Network on an Active Volcano,” IEEE Internet Computing, vol. 10, no. 2, pp.18-25, Mar./Apr. 2006.
[14] S. Ratnasamy, B. Karp, L. Yin, F. Yu, D. Estrin, R. Govindan, and S. Shenker, “GHT: A Geographic Hash Table for Data-Centric Storage,” Proc. First ACM Int'l Workshop Wireless Sensor Networks and Applications (WSNA '02), pp.78-87, Sept. 2002.
[15] D. Niculescu and B. Nath, “Trajectory Based Forwarding and Its Applications,” Proc. Ninth Ann. Int'l Conf. Mobile Computing and Networking (MobiCom '03), pp.260-272, Sept. 2003.
[16] I. Stojmenovic, “A Scalable Quorum Based Location Update Scheme for Routing in Ad Hoc Wireless Networks,” Technical Report TR-99-09, SITE, Univ. of Ottawa, Sept. 1999.
[17] C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, and F. Silva, “Directed Diffusion for Wireless Sensor Networking,” IEEE/ACM Trans. Networking, vol. 11, no. 1, pp.2-16, Feb. 2003.
[18] L. Khelladi and N. Badache, “On the Performance of Directed Diffusion in Dense Sensor Networks,” Proc. Fourth Int'l Conf. Innovations in Information Technology (Innovations '07), pp.113-117, Nov. 2007.
[19] M. Zorzi and R. Rao, “Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Energy and Latency Performance,” IEEE Trans. Mobile Computing, vol. 2, no. 4, pp.349-365, Oct.-Dec. 2003.
[20] N.B. Chang and M. Liu, “Controlled Flooding Search in a Large Network,” IEEE/ACM Trans. Networking, vol. 15, no. 2, pp.436-449, Apr. 2007.
[21] J. Hassan and S. Jha, “Optimising Expanding Ring Search for Multi-Hop Wireless Networks,” Proc. 47th Ann. IEEE Global Telecomm. Conf. (GLOBECOM '04), pp.1061-1065, Nov. 2004.
[22] L. Lima and J. Barros, “Random Walks on Sensor Networks,” Proc. Fifth Int'l Symp. Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt '07), pp.1-5, Apr. 2007.
[23] H. Tian, H. Shen, and T. Matsuzawa, “Random Walk Routing for Wireless Sensor Networks,” Proc. Sixth Int'l Conf. Parallel and Distributed Computing Applications and Technologies (PDCAT '05), pp.196-200, Dec. 2005.
[24] Z.J. Haas, J.Y. Halpern, and L. Li, “Gossip-Based Ad Hoc Routing,” IEEE/ACM Trans. Networking, vol. 14, no. 3, pp.479-491, 2006.
[25] A.V. Kini, V. Veeraraghavan, N. Singhal, and S. Weber, “Smartgossip: An Improved Randomized Broadcast Protocol for Sensor Networks,” Proc. Fifth Int'l Conf. Information Processing in Sensor Networks (IPSN '06), pp.210-217, Apr. 2006.
[26] R. Friedman, D. Gavidia, L. Rodrigues, A.C. Viana, and S. Voulgaris, “Gossiping on MANETs: The Beauty and the Beast,” ACM SIGOPS Operating Systems Rev., vol. 41, no. 5, pp.67-74, 2007.
[27] H. Ling, D. Mosse, and T. Znati, “Coverage-Based Probabilistic Forwarding in Ad Hoc Routing,” Proc. 14th Int'l Conf. Computer Comm. and Networks (ICCCN '05), pp.13-18, Oct. 2005.
[28] M. Uttel and T. Braun, “A Novel Position-Based and Beacon-Less Routing Algorithm for Mobile Ad-Hoc Networks,” Proc. Third IEEE Workshop Applications and Services in Wireless Networks (ASWN '03), pp.197-210, July 2003.
[29] A. Rao, S. Ratnasamy, C. Papadimitriou, S. Shenker, and I. Stoica, “Geographic Routing without Location Information,” Proc. Ninth Ann. Int'l Conf. Mobile Computing and Networking (MobiCom '03), pp.96-108, Sept. 2003.
[30] R. Kiran Kumar, “Information Discovery in Wireless Sensor Networks: Energy Efficiency and Scalability,” master's thesis, Dept. of Computer Science and Eng., Indian Inst. of Technology Madras, Dec. 2008.
[31] MATLAB, http://www.mathworks.com/productsmatlab, 2009.
[32] The Network Simulator, http://www.isi.edu/nsnamns, 2009.
[33] V. Shnayder, M. Hempstead, B. rong Chen, G.W. Allen, and M. Welsh, “Simulating the Power Consumption of Large-Scale Sensor Network Applications,” Proc. Second Int'l Conf. Embedded Networked Sensor Systems (SenSys '04), pp.188-200, Nov. 2004.
[34] Collection Protocol in TinyOS 2.x, http://www.tinyos.net/tinyos-2.x/doc/html tep119.html, 2009.
[35] Tiny OS, http:/www.tinyos.net, 2009.
[36] nesC: A Programming Language for Deeply Networked Systems, http:/nescc.sourceforge.net, 2009.
[37] J. Polastre, J. Hill, and D. Culler, “Versatile Low Power Media Access for Wireless Sensor Networks,” Proc. Second Int'l Conf. Embedded Networked Sensor Systems (SenSys '04), pp.95-107, Nov. 2004.
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool