{"title":"Design of Energy Aware Movement-Assisted Deployment in Wireless Sensor Network","authors":"Jie Jia, Chen Liu, Jing Chen, Xueli Wu","doi":"10.1109/DCOSS.2012.53","DOIUrl":"https://doi.org/10.1109/DCOSS.2012.53","url":null,"abstract":"In this paper, we propose an energy aware movement-assisted deployment algorithm to achieve complete coverage and load balance for wireless sensor networks. By dividing the target area into several coronas with the same width of sensor communication radius, the optimal deployment density is computed for each corona. To the whole network, the movement of sensors can be treated as two steps. For the first step, the nodes move straightly between different coronas to regulate the number of nodes in each corona. For the second step, each node moves the adaptive distance inside the corona to achieve uniform distribution by exchanging messages only to its one-hop neighbor. Simulation results are provided to verify our analysis for wireless sensor networks.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128315490","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":"Network Lifetime Maximization in Delay-Tolerant Sensor Networks with a Mobile Sink","authors":"Zichuan Xu, W. Liang, Yinlong Xu","doi":"10.1109/DCOSS.2012.17","DOIUrl":"https://doi.org/10.1109/DCOSS.2012.17","url":null,"abstract":"In this paper we investigate the network lifetime maximization problem in a delay-tolerant wireless sensor network with a mobile sink by exploiting a nontrivial tradeoff between the network lifetime and the data delivery delay. We formulate the problem as a joint optimization problem that consists of finding a trajectory for the mobile sink and designing an energy-efficient routing protocol to route sensing data to the sink, subject to the bounded delay on data delivery and the given potential sink location space. Due to NP-hardness of the problem, we then propose a novel optimization framework, which not only prolongs the network lifetime but also improves the other performance metrics including the network scalability, robustness, and the average delivery delay. We finally conduct extensive experiments by simulations to evaluate the performance of the proposed algorithm against other heuristics. The experimental results demonstrate that the proposed algorithm outperforms the others significantly in terms of network lifetime prolongation.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130923274","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":"Transparent Integration of Non-IP WSN into IP Based Networks","authors":"Torsten Teubler, M. A. Hail, H. Hellbrück","doi":"10.1109/DCOSS.2012.10","DOIUrl":"https://doi.org/10.1109/DCOSS.2012.10","url":null,"abstract":"Embedded devices connected to the Internet will start an increasing growth of the Internet in near future. Wireless Sensor Networks (WSN) will play a major role in that growth. In the past several solutions were proposed to make sensor network sip capable. Today there are IPv6-Stacks available including web servers running on sensor nodes. However, a gateway is always needed to convert the routing protocols and MAC-Layer Protocols including compression of IP packets to run on these devices. The overhead using IPv6 on the nodes is very high in respect of code size and message overhead. Therefore, in our approach we design and implement a system based on simple protocols target for sensor network nodes and a flexible gateway working in a hybrid fashion for our sensor network test bed. We successfully integrated this non-IP WSN in the Internet and our test bed is productive available from any computer connected to the Internet for reference. In this paper we present the architecture of our solution and present the implementation details of a standard WSN application that can be used for evaluation.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122206425","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":"Achieving High Lifetime and Low Delay in Very Large Sensors Networks Using Mobile Sinks","authors":"Wint Yi Poe, Michael A. Beck, J. Schmitt","doi":"10.1109/DCOSS.2012.20","DOIUrl":"https://doi.org/10.1109/DCOSS.2012.20","url":null,"abstract":"For smaller scale wireless sensor networks (WSN) it has been clearly shown that a single mobile sink can be very beneficial with respect to the network lifetime. Yet, how to plan the trajectories of many mobile sinks in very large WSNs in order to simultaneously achieve lifetime and delay goals has not been treated so far. In this paper, we delve into this difficult problem and propose a heuristic framework using multiple orbits for the sinks' trajectories. The framework is carefully designed based on geometric arguments to achieve both, high lifetime and low delay. In simulations, we compare two different instances of our framework, one conceived based on a load balancing argument and one based on a distance minimization argument, with a set of different competitors spanning from statically placed sinks to battery-state aware strategies. We find our heuristics to perform very favorably: both instances outperform the competitors in both, lifetime and delay. Furthermore, and probably even more importantly, the heuristic, while keeping its good delay and lifetime performance, scales well with an increasing number of sinks.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115269861","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":"Network Topology Optimization for Accelerating Consensus Algorithms under Power Constraints","authors":"C. Asensio-Marco, B. Beferull-Lozano","doi":"10.1109/DCOSS.2012.26","DOIUrl":"https://doi.org/10.1109/DCOSS.2012.26","url":null,"abstract":"The average consensus algorithm is a well known distributed process in which the nodes iteratively communicate with the nodes within their communication range in order to obtain an estimation of the global average. These repeated communications, when performed in a uniformly randomly deployed network, such as a Wireless Sensor Network, lead to several nodes consuming much more power than others, thus reducing the lifetime of the whole network. This paper proposes a fully distributed method that allows the network nodes to suitably decide which subset of communications provides the best performance during the consensus process in terms of convergence time and power efficiency. Our method simultaneously improves both the convergence of the consensus algorithm and the lifetime of the whole network. Moreover, as a benchmark, we propose a convex optimization problem whose results can be compared with those obtained by our distributed approach. Simulation results are presented to show the efficiency of our proposal, comparing our two methods with existing approaches in the related literature.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115150436","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":"LoCaF: Detecting Real-World States with Lousy Wireless Cameras","authors":"Benjamin Meyer, Richard Mietz, K. Römer","doi":"10.1109/DCOSS.2012.9","DOIUrl":"https://doi.org/10.1109/DCOSS.2012.9","url":null,"abstract":"The Internet of Things (IoT) integrates wireless sensors to provide online and real-time access to the state of things and places. However, many interesting real-world states are difficult to detect with traditional scalar sensors. Tiny wireless camera sensor nodes are an interesting alternative as a single camera can observe a large area in great detail. However, low image resolution, poor image quality, and low frame rates as well as varying lighting conditions in outdoor scenarios make the detection of real-world states using these lousy cameras a challenging problem. In this paper we introduce a framework that addresses this problem by providing an end-to-end solution that includes energy-efficient image capture, image enhancement to mitigate low picture quality, object detection with low frame rates, inference of high-level states, and publishing of these states on the IoT. The framework can be flexibly configured by end-users without programming skills and supports a variety of different applications.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116440539","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":"Work in Progress: Resourse-Aware Fault Localization in Large Sensor Networks","authors":"Richard Mietz, K. Römer","doi":"10.1109/DCOSS.2012.49","DOIUrl":"https://doi.org/10.1109/DCOSS.2012.49","url":null,"abstract":"Sensor networks are exposed to hostile environments that may cause failures of single nodes and communication links which affect the whole network. Localizing the cause of the problem in space and time requires to collect diagnostic data from the network. Due to resource and energy constraints, however, it is not possible to continuously collect detailed diagnostic data from all nodes. We therefore propose an incremental approach where first data is logged to flash memory and later the user can pose a sequence of diagnostic queries with decreasing scope and increasing level of detail to pinpoint the cause of the problem.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125076476","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":"Source-Based Routing Trees for Efficient Congestion Control in Wireless Sensor Networks","authors":"Charalambos Sergiou, V. Vassiliou","doi":"10.1109/DCOSS.2012.52","DOIUrl":"https://doi.org/10.1109/DCOSS.2012.52","url":null,"abstract":"Placement of nodes in Wireless Sensor Network (WSNs) is often massive and random. Topology control algorithms focus in lowering the initial network topology, by reducing active nodes and links, thus saving resources and increasing network lifetime. Currently, most algorithms and schemes in WSNs, construct shared, core-based trees, with the sink as a root for this purpose. In this paper, we study whether trees that initiate from each source, called source-based trees, can assist in this purpose and provide, under specific circumstances, an efficient topology control solution. Simulation results show that source-based trees can provide proper topology and routing control solution in WSNs, when are employed along with \"resource\", congestion control algorithms in WSNs.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125176817","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}
Dongxiao Yu, Qiang-Sheng Hua, Yuexuan Wang, F. Lau
{"title":"An O(log n) Distributed Approximation Algorithm for Local Broadcasting in Unstructured Wireless Networks","authors":"Dongxiao Yu, Qiang-Sheng Hua, Yuexuan Wang, F. Lau","doi":"10.1109/DCOSS.2012.39","DOIUrl":"https://doi.org/10.1109/DCOSS.2012.39","url":null,"abstract":"The unstructured multi-hop radio network model, with asynchronous wake-up, no collision detection and little knowledge on the network topology, is proposed for capturing the particularly harsh characteristics of initially deployed wireless adhoc and sensor networks. In this paper, assuming such a practical model, we study a fundamental problem of both theoretical and practical interests--the local broadcasting problem. Given a set of nodes V where each node wants to broadcast a message to all its neighbors that are within a certain local broadcasting range R, the problem is to schedule all these requests in the fewest timeslots. By adopting the physical interference mode land without any knowledge on neighborhood, we give a new randomized distributed approximation algorithm for the local broadcasting problem with approximation ratio O (log n) where nis the number of nodes. This distributed approximation algorithm improves the state-of-the-art result in [22] by a logarithmic factor.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127480614","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":"BANMAC: An Opportunistic MAC Protocol for Reliable Communications in Body Area Networks","authors":"K. S. Prabh, F. Royo, S. Tennina, T. Olivares","doi":"10.1109/DCOSS.2012.37","DOIUrl":"https://doi.org/10.1109/DCOSS.2012.37","url":null,"abstract":"We consider reliable communications in Body Area Networks (BAN), where a set of nodes placed on human body are connected using wireless links. In order to keep the Specific Absorption Rate (SAR) as low as possible for health safety reasons, these networks operate in low transmit power regime, which however, is known to be error prone. It has been observed that the fluctuations of the Received Signal Strength (RSS) at the nodes of a BAN on a moving person show certain regularities and that the magnitude of these fluctuations are significant (5 - 20 dB). In this paper, we present BANMAC, a MAC protocol that monitors and predicts the channel fluctuations and schedules transmissions opportunistically when the RSS is likely to be higher. The MAC protocol is capable of providing differentiated service and resolves co-channel interference in the event of multiple co-located BANs in a vicinity. We report the design and implementation details of BANMAC integrated with the IEEE 802.15.4 protocol stack. We present experimental data which show that the packet loss rate (PLR) of BANMAC is significantly lower as compared to that of the IEEE 802.15.4 MAC. For comparable PLR, the power consumption of BANMAC is also significantly lower than that of the IEEE~802.15.4. For co-located networks, the convergence time to find a conflict-free channel allocation was approximately 1 s for the centralized coordination mechanism and was approximately 4 s for the distributed coordination mechanism.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125827746","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}