Access the full text.
Sign up today, get DeepDyve free for 14 days.
S. Madden, M. Franklin, Joseph Hellerstein, W. Hong
Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tag: a Tiny Aggregation Service for Ad-hoc Sensor Networks
H. Mousannif, H. Moatassime, S. Rakrak (2011)
An energy-efficient scheme for reporting events over WSNsInt. J. Pervasive Comput. Commun., 7
J. Wilke, Z. Benenson, M. Zitterbart, F. Freiling (2009)
Authentic query dissemination and data aggregation in WSN2009 Sixth International Conference on Networked Sensing Systems (INSS)
R. Prakash, Ehsan Nourbakhsh, Kunal Sahu (2009)
Data aggregation in sensor networks: No more a slave to routing2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
W. Su, Gihwan Cho (2010)
Honeycomb-Based Data Aggregation for Range Query in WSNs2010 International Conference on Communications and Mobile Computing, 3
Xiaowei Zhang, Xiaohai Yu, Xiangqun Chen (2005)
Inter-query data aggregation in wireless sensor networksProceedings. 2005 International Conference on Wireless Communications, Networking and Mobile Computing, 2005., 2
E. Ahvar (2010)
EDQD: An Energy-Distance Aware Query-Based Data Aggregation Technique for Wireless Sensor Networks2010 IEEE 24th International Conference on Advanced Information Networking and Applications Workshops
Prakashgoud Patil, N. Patil, N. Ayachit, U. Kulkarni (2010)
Effect of data aggregation on wireless sensor network performanceTrendz in Information Sciences & Computing(TISC2010)
Hongbo Jiang, Shudong Jin, Chonggang Wang (2010)
Parameter-Based Data Aggregation for Statistical Information Extraction in Wireless Sensor NetworksIEEE Transactions on Vehicular Technology, 59
Pu Wang, Cheng Li, Jun Zheng (2007)
Distributed Data Aggregation Using Clustered Slepian-Wolf Coding in Wireless Sensor Networks2007 IEEE International Conference on Communications
B. Krishnamachari, D. Estrin, S. Wicker (2002)
The impact of data aggregation in wireless sensor networksProceedings 22nd International Conference on Distributed Computing Systems Workshops
Yingshu Li, Longjiang Guo, S. Prasad (2010)
An Energy-Efficient Distributed Algorithm for Minimum-Latency Aggregation Scheduling in Wireless Sensor Networks2010 IEEE 30th International Conference on Distributed Computing Systems
S. Habib (2008)
Dynamic Evaluation of Server Placement within a Network Design Tool by using an Embedded Monte Carlo SimulatorInt. J. Bus. Data Commun. Netw., 4
Parth Patel, P. Lapsiwala, R. Kshirsagar (2012)
Data Aggregation in Wireless Sensor NetworkInternational Journal of Managment, IT and Engineering, 2
S. Habib, P. Marimuthu (2011)
Query-based data aggregation within WSN through Monte Carlo simulation
Wei Yu, Thang Le, D. Xuan, Wei Zhao (2004)
Query aggregation for providing efficient data services in sensor networks2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)
L. Buttyán, T. Holczer (2010)
Perfectly anonymous data aggregation in wireless sensor networksThe 7th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE MASS 2010)
S. Habib (2006)
A Monte Carlo simulator for evaluating server placement within network topology designs
Shiow-Fen Hwang, Kun-Hsien Lu, T. Chang, C. Dow (2008)
Hierarchical data gathering schemes in wireless sensor networksInt. J. Pervasive Comput. Commun., 4
S. Madden, M.J. Franklin, J. Hellerstein, W. Hong
TAG: a tiny aggregation service for ad‐hoc sensor networks
Purpose – Energy constraint is always a serious issue in wireless sensor networks, as the energy possessed by the sensors is limited and non‐renewable. Data aggregation at intermediate base stations increases the lifespan of the sensors, whereby the sensors' data are aggregated before being communicated to the central server. This paper proposes a query‐based aggregation within Monte Carlo simulator to explore the best and worst possible query orders to aggregate the sensors' data at the base stations. The proposed query‐based aggregation model can help the network administrator to envisage the best query orders in improving the performance of the base stations under uncertain query ordering. Furthermore, it aims to examine the feasibility of the proposed model to engage simultaneous transmissions at the base station and also to derive a best‐fit mathematical model to study the behavior of data aggregation with uncertain querying order. Design/methodology/approach – The paper considers small and medium‐sized wireless sensor networks comprised of randomly deployed sensors in a square arena. It formulates the query‐based data aggregation problem as an uncertain ordering problem within Monte Carlo simulator, generating several thousands of uncertain orders to schedule the responses of M sensors at the base station within the specified time interval. For each selected time interval, the model finds the best possible querying order to aggregate the data with reduced idle time and with improved throughput. Furthermore, it extends the model to include multiple sensing parameters and multiple aggregating channels, thereby enabling the administrator to plan the capacity of its WSN according to specific time intervals known in advance. Findings – The experimental results within Monte Carlo simulator demonstrate that the query‐based aggregation scheme show a better trade‐off in maximizing the aggregating efficiency and also reducing the average idle‐time experienced by the individual sensor. The query‐based aggregation model was tested for a WSN containing 25 sensors with single sensing parameter, transmitting data to a base station; moreover, the simulation results show continuous improvement in best‐case performances from 56 percent to 96 percent in the time interval of 80 to 200 time units. Moreover, the query aggregation is extended to analyze the behavior of WSN with 50 sensors, sensing two environmental parameters and base station equipped with multiple channels, whereby it demonstrates a shorter aggregation time interval against single channel. The analysis of average waiting time of individual sensors in the generated uncertain querying order shows that the best‐case scenario within a specified time interval showed a gain of 10 percent to 20 percent over the worst‐case scenario, which reduces the total transmission time by around 50 percent. Practical implications – The proposed query‐based data aggregation model can be utilized to predict the non‐deterministic real‐time behavior of the wireless sensor network in response to the flooded queries by the base station. Originality/value – This paper employs a novel framework to analyze all possible ordering of sensor responses to be aggregated at the base station within the stipulated aggregating time interval.
International Journal of Pervasive Computing and Communications – Emerald Publishing
Published: Nov 23, 2012
Keywords: Wireless sensor network; Aggregation; Query‐based; Scheduling; Empirical modelling; Simulation; Monte Carlo simulation
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.