Ravi Balasubramanian, S. Ramasubramanian, A. Efrat
{"title":"Coverage Time Characteristics in Sensor Networks","authors":"Ravi Balasubramanian, S. Ramasubramanian, A. Efrat","doi":"10.1109/MOBHOC.2006.278611","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278611","url":null,"abstract":"We study the problem of coverage of a given area for a maximum duration using a set of battery-operated sensors. Each sensor has a fixed sensing range and a limited lifetime due to the finite battery capacity. Sensors can be activated and deactivated at any time. The goal of this paper is to a find a schedule, determining when to activate and deactivate each sensor, to maximize the time for which every point in the area is covered by at least one sensor. We present several algorithms for this problem and show experimental and theoretical evidences to their efficiency. We also present an algorithm for a new model of coverage, called weak coverage, that does not require each point of the region to be covered all times, as long as the regions that are not covered are small","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"193 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113989088","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":"Location-aware ID Assignment in Wireless Sensor Networks","authors":"Yunhuai Liu, L. Ni","doi":"10.1109/MOBHOC.2006.278601","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278601","url":null,"abstract":"Due to critical resource constraints, associating each sensor node with a global ID is not feasible in wireless sensor networks (WSNs). However, having an ID in each sensor node is the basic assumption in many WSN applications. Therefore, efficient local ID generation schemes, which have not been carefully considered in the past, is of great importance. In this paper, we propose a novel local ID assignment scheme, called GREENWIS. Without having the explicit location information in advance, each node is able to generate a 5-tuple local ID within an application field in a distributed manner using the GREENWIS algorithm. We prove the correctness and show the effectiveness of GREENWIS by comprehensive analysis. A GREENWIS prototype is also deployed in our lab. We introduce our early experience with this design and implementation. We evaluate GREENWIS through intensive experiments. The results show that GREENWIS provides effective local ID assignment in a real WSN environment","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132366007","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}
D. Nandiraju, L. Santhanam, N. Nandiraju, D. Agrawal
{"title":"Achieving Load Balancing in Wireless Mesh Networks Through Multiple Gateways","authors":"D. Nandiraju, L. Santhanam, N. Nandiraju, D. Agrawal","doi":"10.1109/MOBHOC.2006.278655","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278655","url":null,"abstract":"Wireless mesh networks (WMNs) are evolving to be the key technology of the future. As the WMNs are envisioned to provide high bandwidth broadband service to a large community of users, the Internet gateway (IGW) which acts as a central point of Internet attachment for the mesh routers, it is likely to be a potential bottleneck because of its limited wireless link capacity. We propose a novel technique that elegantly balances the load among the different IGWs in a WMN. We switch the point of attachment of an active source serviced gateway depending on the average queue length at the IGW. The proposed load balancing scheme includes: an initial gateway discovery module, which determines a primary gateway for a mesh router and a load balancing module that rebalances the load among the gateways. We use ns-2 for evaluating our proposed scheme and we observe that the proposed scheme is able to balance the traffic efficiently","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132839035","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":"Communication Area Based Positioning","authors":"J. Preden","doi":"10.1109/MOBHOC.2006.278573","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278573","url":null,"abstract":"This paper presents an algorithm for positioning sensor network nodes based on the communication areas of the nodes. The nodes can be positioned either using a small number of anchor nodes or a single location aware mobile node which can determine its location dynamically through external means (e.g. an existing infrastructure, such as GPS). The algorithm does not use any distance or bearing estimations between nodes, but instead the communication areas of anchor nodes are used to determine the position of nodes. The paper presents an overview of the algorithm explaining the main principles of the algorithm. A semi-formal description of the algorithm is given, followed by the description of the simulations. The simulations involved randomly and relatively sparsely distributed nodes in a square area with randomly and more sparsely distributed anchor nodes in the same area. In addition to simulations some tests in a test environment were conducted positioning MICA2 motes and RF ID tags by a mobile location aware platform. The test setup is described and the test results are presented. The paper is concluded by some finalizing remarks and ideas for further research","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116397162","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":"Max-min Fair Rate Allocation in Multi-hop Wireless Ad Hoc Networks","authors":"X. Su, Sammy Chan","doi":"10.1109/MOBHOC.2006.278598","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278598","url":null,"abstract":"In this paper, a price-based rate allocation scheme for multi-hop wireless ad hoc networks is proposed. To accurately reflect the clique constraint of wireless ad hoc networks, the clique-based price is proposed to act as the congestion signal, which controls the end-to-end rates of multi-hop flows. Through simulation, the proposed scheme is shown to be able to effectively distribute the bandwidth, according to max-min fair criterion, to multi-hop flows from the end-to-end perspective","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121779065","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":"AnyServer: Digital Network Platform Technology for Next Generation Ubiquitous Communications","authors":"W. Jia","doi":"10.1109/MOBHOC.2006.278659","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278659","url":null,"abstract":"This paper introduces a multi-million project that intends to design and implement a novel intelligent platform-AnyServer-for providing the ubiquitous communication (video/audio streaming and data transmission) for mobile nodes terminals/handsets to connect and communicate. AnyServer, as the platform, will provide the inter-operability between the different networks, attacking with the following implementation/design objectives and challenging issues: 1) WiFi and 3G-324M multimedia transmission protocols stack, 2) server and networking functions will be implemented to harness a set of servers of call server, media gateway, signaling gateway, and subscriber location registration, 3) adaptive soft-switching package to support mobile units routing and roaming the heterogeneous networks","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-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129157689","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 Push-based Paradigm for Environment Adaptive Application Reconfiguration in Clustered Sensor Networks","authors":"Liang Liu, Huadong Ma, Dan Tao, Dongmei Zhang","doi":"10.1109/MOBHOC.2006.278566","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278566","url":null,"abstract":"Application reconfiguration is essential in order to complement the flexibility and adaptability for sensor networks in the environment monitoring domain. In this paper, we first describe an effective environment adaptive application reconfiguration (EAAR) mechanism. Then we present a push-based paradigm to carry out EAAR, where instead of a pull-based paradigm proposed in our prior work. This paradigm suits for clustered sensor networks, which provides a software entity, reconfiguration agent, to perform the process of reconfiguration on cluster head nodes. Reconfiguration agent is a novel concept, and has great potential in providing energy-efficient reconfiguration processing with low latency. A prototype is constructed to show the workflow of reconfiguration agent. Particularly, we design two metrics: execution time and energy consumption, and use the simulation platform to quantitatively measure the performance of different paradigms in the reconfiguration procedure. Experimental results show that push-based paradigm performs better than pull-based one","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-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129210490","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":"Extended Model for Performance Analysis of Non-Saturated IEEE 802.11 DCF in Erroneous Channel","authors":"P. Latkoski, Z. Hadzi-Velkov, B. Popovski","doi":"10.1109/MOBHOC.2006.278651","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278651","url":null,"abstract":"In this paper, we provide an extended model for analytical analysis of an IEEE 802.11 WLAN that accommodates the non-saturated operation of the network, the finite number of (re)transmission attempts for each station and the erroneous conditions in the wireless channel. This model builds on top of an existing Markov chain-based models for the station's backoff counter and proves to be more realistic that the original ones. We derive a generalized expression for the station's transmission probability, which is essential for determination of all system's performance measures. We also present a set of previously unpublished performance results for the throughput, the discard probability and the collision probability in function of the retry limit and the packet error rate","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116866313","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 Measurement-Based Study of WLAN to Cellular Handover","authors":"M. Smadi, S. V. Azhari, T. D. Todd","doi":"10.1109/MOBHOC.2006.278643","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278643","url":null,"abstract":"Real-time vertical handover is an important capability for multimode WLAN/cellular handsets. In many cases however, seamless handover can be very difficult to achieve, since WLAN coverage may be lost long before a cellular call leg can be triggered and established. Worse-case handovers of this kind occur when mobile users walk from indoor building WLAN coverage to outdoors during voice connections. In this paper we report on a measurement-based study of WLAN-to-cellular handover. Our results are based on extensive IEEE 802.11 measurements that were made on the McMaster University campus during the summer of 2005. Our methodology involved traversing many indoor-to-outdoor paths for a large number of campus buildings and exits while monitoring multi-AP Wi-Fi coverage. The collected data was then processed to determine the probability of seamless handover using classical vertical handover algorithms. The results presented give important insights into the difficulty of this problem, and relate to issues such as Wi-Fi deployment type, handover triggering, and Wi-Fi link loss threshold. The results provided enable handset designers and WLAN administrators to better understand the sensitivity of vertical handover performance to these parameters and how they can be optimized","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114566824","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":"Field trials of two 802.11 residual bandwidth estimation methods","authors":"Martin N. Nielsen, Knut Øvsthus, L. Landmark","doi":"10.1109/MOBHOC.2006.278637","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278637","url":null,"abstract":"Ad hoc networks have attracted much attention due to their decentralized architecture and potential mobility. The latter promise has sparked research aimed towards routing and quality of service (QoS) admission schemes. The volatile links that are inherent to these networks have however spawned a need for a cross-layering service below IP for local route and QoS decision making, or information dissemination to participating hosts. We have conducted field trials of an active and a passive estimation method implemented in a real wireless driver to estimate the residual bandwidth. Through these tests we show how residual bandwidth estimates can be obtained in an 802.11 wireless network and identify the strengths and weaknesses of their underlying methods. The implemented wireless driver collects per link bandwidth data, local retransmission count and expected transmission time","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123165089","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}