Energy Efficient Adaptive Message Transmission Algorithm for Wireless Sensor Networks

Guilin Li; Jianzhong Li; Longjiang Guo
June 2006
Journal of Digital Information Management;Jun2006, Vol. 4 Issue 2, p142
Academic Journal
An energy efficient adaptive message transmission algorithm is proposed to save the energy consumption of the wireless sensor networks when answering the event-based ad hoc query. Compared with other algorithms based on either active or inactive message transmission mode, our adaptive algorithm emphasizes that every event lasts for a period of time, in which the ratio between the query frequency and the data production frequency changes from time to time, so using only one kind of message transmission mode is not enough to save energy. Our algorithm can adaptively change the message transmission mode for the sensor nodes according to this ratio. Experimental results showed that our adaptive algorithm could save more energy than other algorithms.


Related Articles

  • Secure Query in Wireless Sensor Network Using Underground Parties. Haiping Huang; Yi Dou; Jiutian Chen; Juan Feng; Xiaolin Qin // Journal of Networks;Dec2012, Vol. 7 Issue 12, p2063 

    Recently, secure query has become a significant issue for researchers. It proposes the concept of secure multi-party query in Internet of things or sensor networks making use of "underground parties" to guarantee network security. Based on a novel network model assumption, it adopts homomorphic...

  • A Mass Production Technique to Speed Multiple-Query Optimization and Physical Database Design. Helman, Paul; Rosenthal, Arnon // ORSA Journal on Computing;Winter91, Vol. 3 Issue 1, p33 

    The logic of many query optimizers corresponds to searching a graph that contains all alternative intermediate results considered by the optimizer. We consider the problem, "Given a query Q, determine the cost of a best strategy that uses intermediate result v to compute Q, assuming that v is...

  • Wireless Sensor Networks Database: Data Management and Implementation. Ping Liu // Sensors & Transducers (1726-5479);Apr2014, Vol. 168, p173 

    As the core application of wireless sensor network technology, Data management and processing have become the research hotspot in the new database. This article studied mainly data management in wireless sensor networks, in connection with the characteristics of the data in wireless sensor...

  • Performance analysis of cache consistency strategies for multi-hop wireless networks. Li, Wenzhong; Chan, Edward; Chen, Daoxu; Lu, Sanglu // Journal of Supercomputing;Nov2012, Vol. 62 Issue 2, p1065 

    Data caching is widely used to facilitate information access in wireless mobile networks. Caching frequently used content on mobile clients brings benefits by reducing bandwidth usage, saving energy, and leveraging server workload. Maintaining cache consistency is an important issue in mobile...

  • Indexing for Moving Objects in Multi-Floor Indoor Spaces That Supports Complex Semantic Queries. Hui Lin; Ling Peng; Si Chen; Tianyue Liu; Tianhe Chi // ISPRS International Journal of Geo-Information;Oct2016, Vol. 5 Issue 10, p1 

    With the emergence of various types of indoor positioning technologies (e.g., radio-frequency identification, Wi-Fi, and iBeacon), how to rapidly retrieve indoor cells and moving objects has become a key factor that limits those indoor applications. Euclidean distance-based indexing techniques...

  • Localized algorithms for coverage boundary detection in wireless sensor networks. Zhang, Chi; Zhang, Yanchao; Fang, Yuguang // Wireless Networks (10220038);Jan2009, Vol. 15 Issue 1, p3 

    Connected coverage, which reflects how well a target field is monitored under the base station, is the most important performance metric used to measure the quality of surveillance that wireless sensor networks (WSNs) can provide. To facilitate the measurement of this metric, we propose two...

  • A Survey on Join Techniques. Hemalatha, G.; Thanuskodi, K. // Annual International Conference on Advances in Distributed & Par;Nov2010, pR161 

    Query processing in relational database involves two parts: query execution and query optimization. Usually query execution takes more time than query optimization. The Most expensive part of query execution is Joins. Joins are statements that retrieve data from more than one table. A Join is...

  • Fuzzy Query Processing. Mishra, Jaydev // International Journal of Research & Reviews in Next Generation N;Mar2011, Vol. 1 Issue 1, p35 

    In real world applications we often need to test the queries based on fuzzy data. For example, some one can specify as "find students' whose age is around 17 years old."; "find tall person". "find employee with high salary"; "find country with low population" etc. This fuzziness in measurement...

  • Top-k Spatial Preference Queries in Directed Road Networks. Attique, Muhammad; Hyung-Ju Cho; Jin, Rize; Tae-Sun Chung // ISPRS International Journal of Geo-Information;Oct2016, Vol. 5 Issue 10, p1 

    Top-k spatial preference queries rank objects based on the score of feature objects in their spatial neighborhood. Top-k preference queries are crucial for a wide range of location based services such as hotel browsing and apartment searching. In recent years, a lot of research has been...

  • ENERGY EFFICIENT WIRELESS COMMUNICATION USING GENETIC ALGORITHM GUIDED FASTER LIGHTWEIGHT DIGITAL SIGNATURE ALGORITHM (GADSA). Sarkar, Arindam; Mandal, J. K. // International Journal of Advanced Smart Sensor Network Systems;Jul2012, Vol. 2 Issue 3, p9 

    In this paper GA based light weight faster version of Digital Signature Algorithm (GADSA) in wireless communication has been proposed. Various genetic operators like crossover and mutation are used to optimizing amount of modular multiplication. Roulette Wheel selection mechanism helps to select...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics