{"title":"Integer Programming Scheme for Target Coverage in Heterogeneous Wireless Sensor Networks","authors":"X. Xing, Jie Li, Guojun Wang","doi":"10.1109/MSN.2010.18","DOIUrl":"https://doi.org/10.1109/MSN.2010.18","url":null,"abstract":"This paper addresses the polytype target coverage problem for heterogeneous wireless sensor networks (HWSNs) with clustered configurations. This problem is formulated as an integer programming (IP) problem for maximizing the whole lifetime of HWSNs. We present an energy-efficient target coverage algorithm (ETCA) to solve this problem and balance the energy consumption of sensor nodes. Each sensor node first calculates its sensing capability with neighbors' and sends a message with its current status information to a clusterhead. Then, the clusterhead decides which sensing units should be turned on to cover the targets in the most optimized way based on the information received from all its member nodes. Simulation results show that the performance of ETCA is close to the IP-solution that is an optimal coverage scheme regarding the energy efficiency. Moreover, ETCA can prolong 16% network lifetime compared with the energy first (EF) algorithm.","PeriodicalId":424337,"journal":{"name":"2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115273117","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Cross-Layer MAC Mechanism to Solve Performance Anomaly in MANET","authors":"Yumei Liu, Bo Lv, Yan Li","doi":"10.1109/MSN.2010.49","DOIUrl":"https://doi.org/10.1109/MSN.2010.49","url":null,"abstract":"Since the IEEE 802.11 standard supports multiple data rates at the physical layer, many rate adaptation mechanisms have been proposed to utilize this multi-rate capability by dynamically switching rates in response to different channel conditions. In IEEE 802.11b networks, the guarantee of an equal transmission opportunity for all participating nodes results in performance anomaly. Traditional solutions have some limitations when solving performance anomaly, especially when dealing with multi-hop networks. Competition in ad hoc networks usually occurs between multi-hop paths. However, competitive nodes’ data rates could not reflect the whole competitive paths’ rate information. In this paper, we propose a new cross-layer MAC mechanism, which allows nodes acquire the whole path’s rate information by exchanging information between MAC and Routing layer. We estimate each path’s competitive level, which represents the whole path’s data transmission capability, and use it as the criteria for allocating the channel. When collision happens, nodes on the path with higher competitive level have a more time share of channel. We evaluate the performance of our mechanism on the network simulator NS-2. Compared with RBAR, by solving performance anomaly in multi-hop networks, the proposed protocol can increase the aggregate throughput by 5%-15% while decreasing the average end-to-end delay by 30%.","PeriodicalId":424337,"journal":{"name":"2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117073744","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Inferring Technical Constraints of a Wireless Sensor Network Application from End-User Requirements","authors":"F. J. Oppermann, Steffen Peter","doi":"10.1109/MSN.2010.32","DOIUrl":"https://doi.org/10.1109/MSN.2010.32","url":null,"abstract":"This paper describes a two-step process to infer specific technical constraints and parameters needed for a reliable mission-specific design of wireless sensor networks (WSN). As the first step, we propose a new requirement catalog helping end-users to formulate a complete and consistent specification of WSN mission requirements. Its generality allows the unambiguous characterization of a wide spectrum of applications from the end-user's perspective. As the second step, we introduce a methodology to deduce fine grained technical specifications from the general requirements. The proposed automatic graph-based requirement expansion approach translates the content of the catalog and additional requirements to specific technical terms, which provide the basis for an application-specific WSN design. A real-world use case – a new WSN application in the area of critical infrastructure protection – demonstrates the applicability of the presented approach.","PeriodicalId":424337,"journal":{"name":"2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123756231","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Clapping and Broadcasting Synchronization in Wireless Sensor Network","authors":"Xin Qian, Xingfa Shen, Guojun Dai, Jianhui Zhang, Changping Lv","doi":"10.1109/MSN.2010.28","DOIUrl":"https://doi.org/10.1109/MSN.2010.28","url":null,"abstract":"Although there are a lot of synchronization protocols in WSN, almost all of them face the same problem, that is, synchronization overhead has not been well controlled. The root of this problem is that they have adopted the same basic communication model— pairwise communication model. Increasing communication overhead in synchronization shortens the lifetime of the system and limits the wide application of the WSN. This paper proposes the Clapping and Broadcasting Synchronization (CBS) for sensor network, which is especially designed for large-scale sensor networks with low communication overhea and high synchronization accuracy. On the one hand, the proposed synchronization reduces communication overhead dramatically by utilizing \"broadcaster-receiver\" communication model. The basic idea of \"broadcaster-receiver\" is using broadcasting rather than pairwise communication to accomplish synchronization. On the other hand, the initial offset of lock soft clock can be successfully eliminated by the operation of clapping nodes, which can indeed bring benefits in terms of the synchronization accuracy. The advantage in communication overhead is obviously. We prove that the communication overhead after the completion of initialization is close to (W i=1 1 min(Ti ) ), which means the system just need send (W i=1 1 min(Ti ) ) messages to perform synchronization once. And that is close to the minimum message number that let all nodes in the network receive a message. Its communication overhead is at least 50 percent of FTSP or less. The gap between them will increase dramatically with the increase of the network. Additionally, feasibility and reliability of the CBS have been verified in the experiment. The CBS was implemented on the TelosB platform to reach the real parameters of sensor nodes. And the simulation in large-scale was carried out under MATLAB. In Single-hop case, around 80% synchronization errors are bounded in 20?s, and the average per-hop synchronization error in large-scale was in the microsecond range. That means comparing with the existing famous protocol like TPSN or FTSP, the CBS significantly reduce the communication overhead without sacrificing synchronization accuracy.","PeriodicalId":424337,"journal":{"name":"2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134262734","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Ghaddar, Tahiry Razafindralambo, I. Simplot-Ryl, D. Simplot-Ryl, Samar Tawbi
{"title":"Towards Energy-Efficient Algorithm-Based Estimation in Wireless Sensor Networks","authors":"A. Ghaddar, Tahiry Razafindralambo, I. Simplot-Ryl, D. Simplot-Ryl, Samar Tawbi","doi":"10.1109/MSN.2010.12","DOIUrl":"https://doi.org/10.1109/MSN.2010.12","url":null,"abstract":"A primary purpose of sensing in a sensor network is to collect and aggregate information about a phenomenon of interest. The batteries on today’s wireless sensor barely last a few days, and nodes typically expend a lot of energy in computation and wireless communication. Hence, the energy efficiency of the system is a major issue. Different representative mechanisms has been proposed to achieve a long lived sensors such as “clustering mechanisms” as well as Aggregation techniques to reduce the amount of data communication generated by sensors. Depending on the data type, ARMA series and forecasting are possible ways to reduce data transmission. In this work, we adopt single-hop clustering mechanism where all sensor nodes in a cluster communicate with their Cluster-Head (or sink) via single hop (such as In/On body sensors for personal health monitoring,..). We propose different data aggregation algorithms based on the AutoRegressive model, to predict local readings and reduce the communication traffic. We evaluate the performance of our work in terms of communication cost and energy consumption. We also extend our work to enhance the prediction accuracy by estimating dynamic prediction threshold. Our simulation shows that depending on data type, communication overhead and rate can be reduced and a considerable accuracy prediction can be obtained.","PeriodicalId":424337,"journal":{"name":"2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134131229","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Does Loss Rate Really Matter? An Experimental Study on Time Synchronization Protocol in Wireless Sensor Networks","authors":"Yubo Yan, Lei Zhang, Panlong Yang","doi":"10.1109/MSN.2010.38","DOIUrl":"https://doi.org/10.1109/MSN.2010.38","url":null,"abstract":"In wireless sensor networks, there are many link quality measurement metrics such as RSSI (Received Signal Strength Indicator), LQI (Link Quality Indicator) and PRR (Packet Reception Rate), which can be used under different channel quality and application scenarios. As in time synchronization, channel quality would be essential to the clock synchronization. The broadcast nature of time synchronization algorithm makes channel quality measurement complex. Moreover, the measurement on channel quality would be costly. We make an experimental study on time synchronization in wireless sensor network. Firstly, we use the RSSI and PRR with different packet lengths, secondly, we find that, the PRR would be accurate but costly, and the RSSI is not accurate enough for time synchronization algorithm evaluation. In the end, we propose a channel clustering and categorization mechanism in dealing with the channel measurement difficulties. And we find that, in dealing with the lossy links, the compensation model for synchronization errors is more important than reliable transmissions. Also, the proposed measurement would be helpful to the time synchronization algorithm, especially the FTSP (Flooding Time Synchronize Protocol).","PeriodicalId":424337,"journal":{"name":"2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115722179","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Trajectory-Based Power Control Scheme for Wireless Networks","authors":"Mingbo Xiao, Jing Zhang, Guangsong Yang","doi":"10.1109/MSN.2010.10","DOIUrl":"https://doi.org/10.1109/MSN.2010.10","url":null,"abstract":"Power control is an important component of the resource management strategy in wireless networks to achieve higher utilization and/or better quality of service. In this paper, we present a framework of decentralized power control called trajectory-based power control (TBPC), by setting the SIR target of each wireless station according to some trajectory, which is specified to reflect the corresponding service requirements. Different trajectories may lead to different dynamic behaviors and different levels of priority in service. This scheme is simple to implement, flexible to tune, and general to encompass several well-known schemes as special cases. Moreover, by tuning some parameters in TBPC, fairness, adaptiveness, and system convergence are readily achieved.","PeriodicalId":424337,"journal":{"name":"2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122863276","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Prediction-Based Activation in WSN Tracking","authors":"Jianghai Li, X. Chen, Q. Jia, X. Guan","doi":"10.1109/MSN.2010.21","DOIUrl":"https://doi.org/10.1109/MSN.2010.21","url":null,"abstract":"In Wireless Sensor Network (WSN) based tracking, the random factors in the target’s movement and the sensors’ measurement together with the limited sensing ability will cause target loss. Therefore, target loss probability is important for the WSN design and performance evaluation. In this paper, a theoretical analysis of the target loss probability with other key parameters is carried out. Based on the analysis, an adaptive-radius activation policy is developed to reduce target loss. Numerical examples demonstrate adaptive-radius activation policy is effective.","PeriodicalId":424337,"journal":{"name":"2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129136476","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Performance of Wireless Mesh Networks with Three Sector Antenna","authors":"Xiaohan Liu, Hiraku Okada, K. Mase","doi":"10.1109/MSN.2010.29","DOIUrl":"https://doi.org/10.1109/MSN.2010.29","url":null,"abstract":"Wireless Mesh Networks (WMN) is an essential technology based on mobile ad hoc networks (MANETs). A three sector antenna system applied to WMN was proposed in early 2010, and system performance was analyzed. In this paper, we introduce a real-world three sector antenna system set up in the current WMN test bed in Niigata University, which employs IEEE 802.11 wireless LAN and supports multi-interface and multi-channel. Channel assignment is performed to the system, and two network patterns are acquired. A series of real-world single-flow and multi-flow throughput measuring experiments are performed to the two network patterns using three sector antenna system. The performance and characteristics of the system are discussed. The test bed node has the exchange function of three sector antenna and omni directional antenna. We discuss a preliminary comparison between the two antenna system. And the three sector antenna system achieves much better throughput performance than the omni directional antenna system on the basis of the one-hop throughput measuring experiment.","PeriodicalId":424337,"journal":{"name":"2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131660637","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
H. Hernández, T. Baumgartner, M. Blesa, C. Blum, A. Kröller, S. Fekete
{"title":"A Protocol for Self-Synchronized Duty-Cycling in Sensor Networks: Generic Implementation in Wiselib","authors":"H. Hernández, T. Baumgartner, M. Blesa, C. Blum, A. Kröller, S. Fekete","doi":"10.1109/MSN.2010.27","DOIUrl":"https://doi.org/10.1109/MSN.2010.27","url":null,"abstract":"In this work we present a protocol for self-synchronized duty-cycling in wireless sensor networks with energy harvesting capabilities. The protocol is implemented in Wiselib, a library of generic algorithms for sensor networks. Simulations are conducted with the sensor network simulator Shawn. They are based on the specifications of real hardware known as iSense sensor nodes. The experimental results show that the proposed mechanism is able to adapt to changing energy availabilities. Moreover, it is shown that the system is very robust against packet loss.","PeriodicalId":424337,"journal":{"name":"2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130648563","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}