{"title":"Optimal Placement of Wireless Sensor Nodes with Fault Tolerance and Minimal Energy Consumption","authors":"S. Chaudhry, V. Hung, R. Guha","doi":"10.1109/MOBHOC.2006.278621","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278621","url":null,"abstract":"In this paper, an evolutionary algorithm is presented to develop a solution for the variable radii sensor placement optimization problem. Sensor nodes are placed in a sensor field such that maximum coverage of the target region is achieved. Coverage is defined in terms of monitoring points of interest. In point coverage, it is desired to place the sensor nodes such that certain target points in the area to be monitored are efficiently covered. The sensors are assumed to have varying communication and sensing radii within specified ranges. To attain a certain degree of fault tolerance, the network is required to have k-connectivity. Therein, the challenge lies in finding a solution that provides the optimal choice and arrangement of sensor nodes with a minimized overall energy consumption. Our devised algorithm places the sensors to form an energy-efficient and fault tolerant network that provides coverage of the given query points","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116156272","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}
B. Liu, B. Otis, S. Challa, P. Axon, C. Chou, S. Jha
{"title":"On the Fading and Shadowing Effects for Wireless Sensor Networks","authors":"B. Liu, B. Otis, S. Challa, P. Axon, C. Chou, S. Jha","doi":"10.1109/MOBHOC.2006.278597","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278597","url":null,"abstract":"Most ad hoc and sensor network research assumes idealized radio propagation models without considering fading and shadowing effects. Experimental results have shown that many well-designed protocols will fail simply because of fading and shadowing experienced in a realistic wireless environment. While fading and shadowing for radio propagation are well understood in wireless communication community, they are rarely studied in network level research for wireless sensor networks. This paper studies the fading and shadowing effects on the performance of different MAC protocols for wireless sensor networks. We show that fading and shadowing can have a significant influence on network performance. We study and compare network performance for three different systems: 1) a multi-channel CDMA system; 2) a pure CDMA system; 3) a contention based system. Through discrete event simulation (using ns-2), we show that the multi-channel CDMA system outperforms the pure CDMA system as well as the contention based system under fading and shadowing environments","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125988481","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}
Wenzhan Song, Fenghua Yuan, R. LaHusen, B. Shirazi
{"title":"Time-Optimum Packet Scheduling for Many-to-One Routing in Wireless Sensor Networks","authors":"Wenzhan Song, Fenghua Yuan, R. LaHusen, B. Shirazi","doi":"10.1080/17445760601111459","DOIUrl":"https://doi.org/10.1080/17445760601111459","url":null,"abstract":"This paper studies the WSN application scenario with periodical traffic from all sensors to a sink. We present a time-optimum and energy-efficient packet scheduling algorithm and its distributed implementation. We first give a general many-to-one packet scheduling algorithm for wireless networks, and then prove that it is time-optimum and costs max (2N(u1)-1, N(u0)-1) time slots, assuming each node reports one unit of data in each round. Here N(u0) is the total number of sensors, while N(u1) denotes the number of sensors in a sink's largest branch subtree. With a few adjustments, we then show that our algorithm also achieves time-optimum scheduling in heterogeneous scenarios, where each sensor reports a heterogeneous amount of data in each round. Then we give a distributed implementation to let each node calculate its duty-cycle locally and maximize efficiency globally. In this packet scheduling algorithm, each node goes to sleep whenever it is not transceiving, so that the energy waste of idle listening is also eliminated. Finally, simulations are conducted to evaluate network performance using the Qualnet simulator. Among other contributions, our study also identifies the maximum reporting frequency that a deployed sensor network can handle","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117129015","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":"Deterministic Data Reduction in Sensor Networks","authors":"Hüseyin Akcan, Hervé Brönnimann","doi":"10.1109/MOBHOC.2006.278602","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278602","url":null,"abstract":"The processing capabilities of wireless sensor nodes enable to aggregate redundant data to limit total data flow over the network. The main property of a good aggregation algorithm is to extract the most representative data by using minimum resources. From this point of view, sampling is a promising aggregation method, that acts as surrogate for the whole data, and once extracted can be used to answer multiple kinds of queries (such as AVG, MEDIAN, SUM, COUNT, etc.), at no extra cost. Additionally, sampling also preserves the correlation info within multi-dimensional data, which is quite valuable for further data mining. In this paper, we propose a novel, distributed, weighted sampling algorithm to sample sensor network data and compare to an existing random sampling algorithm, which to the best of our knowledge is the only algorithm to work in this kind of setting","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134297350","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":"SeLoc: Secure Localization for Wireless Sensor and Actor Network","authors":"Jianqing Ma, Shiyong Zhang, Yiping Zhong, Xiaowen Tong","doi":"10.1109/MOBHOC.2006.278666","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278666","url":null,"abstract":"The need for efficient and secure localization is an important issue in a scalable self-organizing network. However, exiting secure solutions are not well suitable or effective for wireless sensor and actor networks (WSANs) because of the features of WSANs (e.g. node heterogeneity). In this paper, we propose a novel approach (SeLoc) to secure localization for WSAN based on DV-Hop and hidden actors. After passively receiving authentication messages and minimum hop numbers from sensor nodes, these nearby actors distributively compute these sensors' location by actor-actor coordination and maximum likelihood estimators (MLE). By filtering inaccurate/false localization information, the SeLoc localization scheme can prevent these location attacks and improve the accuracy of localization. In addition, we also propose the voting-based location verification scheme in this paper. This verification scheme cannot only effectively decrease the success probability of attack, but also tolerate attacks to some extend. The analysis shows that SeLoc scheme is robust against location attacks and against other attacks like wormhole attacks, Sybile attacks. Also, comparing with other infrastructure-centric localization schemes, SeLoc scheme is energy saving, economical and secure for WSAN by fully using the features of WSAN","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"14 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133077372","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":"The Study of False Route Breakage in IEEE 802.11 based Ad Hoc Networks","authors":"Xia Li, K. Chua, P. Kong","doi":"10.1109/MOBHOC.2006.278592","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278592","url":null,"abstract":"In a 802.11 based mobile ad hoc network (MANET), the routing protocol may wrongly assume that a route is broken due to temporal packet loss in connectivity arising from multiple packet collisions, which we term as a false route breakage. In this paper, we investigate the impact of false route breakages in MANETs. It is found that false route breakage is dependent on the size of packets transmitted in a network and the path length of a source-destination pair. We present a protocol enhancement to the IEEE 802.11 MAC protocol which increases the reliability of wireless links by reducing false route breakages. We achieve the goal of alleviating false route breakages by initiating a HELLO message to the sender whenever the number of RTS received by a receiver exceeds a threshold. The simulation results show that the proposed modification substantially reduces the false route breakages and improves throughput by up to 35%","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128922885","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":"Design and Implementation of a Sensor Network Based Location Determination Service for use in Home Networks","authors":"Sayed Ahmad, Mehmet Rasit Eskicioglu, P. Graham","doi":"10.1109/MOBHOC.2006.278623","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278623","url":null,"abstract":"Location determination is a fundamental component enabling context aware home applications. Ultrasound, floor sensors and computer vision, among others, have been proposed for location determination, each with its own benefits and limitations. In this paper we discuss the design, implementation and evaluation of a location determination system based on sensor networks. Our implementation includes three components: the location determination system which adapts and extends Motetrack for in-home use, a location storage system, and a middleware interface to allow home applications to access both current and historical location information. Our system uses Crossbow Mica2 and Mica2Dot sensors to provide 28th, 50th, 85th and 97th percentile location errors of under 1,1.5,2 and 3 meters, respectively. This will support most home services which typically require only \"room level\" accuracy. Using sensor nodes in our location determination scheme provides a low cost solution and eliminates dependence on the availability of existing, in-home equipment to perform the location determination computations","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128748202","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":"Anchor-Free Localization in Rapidly-Deployed Wireless Sensor Networks","authors":"Hui-jie Qu, S. Wicker","doi":"10.1109/MOBHOC.2006.278624","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278624","url":null,"abstract":"In this paper we consider a wireless sensor network consisting of a single sink node at the center of a field of randomly distributed sensors. An anchor-free node localization algorithm is proposed in which the sink node imparts radial location information through the phased-array transmission of a series of beacons. The individual sensors use knowledge of received beacons and information from nearest neighbors to identify the sub-sectors in which they reside. This location information can then be used as the basis for an emergent routing algorithm. We present the localization algorithm, deduce the partition error analytically, and then provide simulation results. The results indicate that the localization performance improves with node density, and is robust against RSS measurement noise","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127332131","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}
Jingyuan Li, Liusheng Huang, W. Jia, Mingjun Xiao, P. Du
{"title":"An Efficient Implementation of File Sharing Systems on the Basis of WiMAX and Wi-Fi","authors":"Jingyuan Li, Liusheng Huang, W. Jia, Mingjun Xiao, P. Du","doi":"10.1109/MOBHOC.2006.278658","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278658","url":null,"abstract":"This paper proposes an efficient algorithm for P2P file sharing systems based on WiMAX mesh mode and Wi-Fi technologies. Wireless networks in our system are hierarchically divided into three layers: Wi-Fi based wireless local area networks under a subscriber station; the mesh network of subscriber stations under a base station; the network of base stations. File lookup procedure may go through three steps: the requesting end host firstly looks up for the requested file within it's neighbor end hosts under the same subscribe station; if fails, then it sends lookup messages to the nearest subscriber stations in the mesh network following to a changed dynamic source routing protocol; if both the steps fail, then the requesting end host searches the requested file through the chord-based base stations' overlay. By statistical analysis and simulations, we prove that our layered P2P file sharing system can reduce the number of lookup messages in physical networks and prevent over expenses of precious bandwidth in wireless metropolitan area networks","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125587023","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":"On the Energy Hole Problem of Nonuniform Node Distribution in Wireless Sensor Networks","authors":"Xiaobing Wu, Guihai Chen, Sajal K. Das","doi":"10.1109/MOBHOC.2006.278555","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278555","url":null,"abstract":"In this paper, we investigate the theoretical aspects of the nonuniform node distribution strategy in wireless sensor networks, which aims to avoid the energy hole around the sink. We find that in a circular sensor network with a nonuniform node distribution and constant data reporting, the unbalanced energy depletion among the nodes in the whole network is unavoidable. This is because although all the inner nodes have used up their energy simultaneously, the outmost part of the network may still have energy left. In spite of this fact, a suboptimal energy efficiency among the inner parts of the network is possible if the number of nodes increases with geometric proportion from the outer parts to the inner ones. In our proposed nonuniform node distribution strategy, the ratio between the node densities of the adjacent (i+1)th corona and the ith corona is equal to (2i-1)/q(2i+1), where q is the geometric proportion mentioned above. We also present a routing algorithm with this node distribution strategy. Simulation experiments demonstrate that when the network lifetime has ended, the nodes in the inner parts of the network achieve nearly balanced energy depletion, and only less than 10% of the total energy is wasted","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114549352","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}