{"title":"A New Power-Efficient Scheme to Deliver Time-Sensitive Data in Sensor Networks","authors":"Shanzhong Zhu, Wei Wang, C. Ravishankar","doi":"10.1109/MOBHOC.2006.278556","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278556","url":null,"abstract":"We present a power-efficient scheme to deliver time sensitive data packets in sensor networks. Data generated by sensors are frequently time sensitive in applications such as hazard monitoring systems, traffic controlling systems and battlefield commanding systems. Such data are associated with end-to-end deadlines, within which they must reach the base station. We make two contributions in this work. First, we propose a novel load-balanced routing scheme that distributes data packets evenly among the nodes relaying data towards the base station, avoiding bottlenecks and increasing the likelihood that packets will meet their deadlines. Second, we propose a method of grouping smaller packets into larger ones by delaying data transmissions at the relaying nodes whenever slack times are positive. Our packet grouping scheme significantly reduces packet transmissions, reduces congestion, and saves power in the sensor network. We verify the effectiveness of our approach through extensive simulations using the ns-2 simulation package","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"38 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":"114666667","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 Scalable Quorum Based Location Service in Ad Hoc and Sensor Networks","authors":"Dandan Liu, I. Stojmenovic, X. Jia","doi":"10.1109/MOBHOC.2006.278591","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278591","url":null,"abstract":"Location service provides position of mobile destination to source node to enable geo-routing. Previous location service protocols suffer from partial flooding overhead, and/or location failures in group movement scenarios. To overcome those deficiencies, we propose a quorum-based location service. The basic idea is that destination node registers its location along a `column' to form an update quorum. Source node makes a query along a `row' to form a search quorum. The destination location is found at the intersection between the update and search quorums. Four strategies are proposed to adjust the quorum system. To guarantee the success of location retrieval, both search and update quorums are extended by face routing which traverses outer network boundary","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"86 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":"122082347","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":"Channel Access Using Opportunistic Reservations in Ad Hoc Networks","authors":"Xiaoqiao Meng, J. Garcia-Luna-Aceves","doi":"10.1109/MOBHOC.2006.278639","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278639","url":null,"abstract":"We introduce a medium access control protocol for ad hoc networks. The new protocol, which we call ORMA (opportunistic reservation multiple access) is aimed at providing both high throughput and bounded channel access delays, which are critical for supporting integrated voice and data services over ad hoc networks. In ORMA, the channel is divided into a random access section and a scheduled access section. The first is used to exchange neighborhood information, the latter is used for data transmissions over time slots organized in frames, with each time slot being accessed through reservations or probabilistic elections. To attain high throughput, nodes access data slots based on a fair election in which they win with a certain probability. To attain bounded channel access delays, nodes reserve time slots by using a novel opportunistic reservation. The performance of ORMA is studied by both analysis and simulations. It is also compared against the performance of schemes based entirely on probabilistic or fixed conflict-free slot assignment","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"56 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":"127560535","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":"Apples, Oranges, and Testbeds","authors":"K. Langendoen","doi":"10.1109/MOBHOC.2006.278578","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278578","url":null,"abstract":"Research into wireless sensor networks is rapidly moving from simulations to realistic testbeds. The widely varying characteristics (e.g., radio hardware, #nodes, and topology) of various testbeds raise concerns about the validity of results across different testbeds. This paper presents empirical data of an experiment involving one application (Surge), two routing protocols (multihop and mintroute), and two testbeds (MoteLab and MistLab). The outcome is somewhat mixed. When increasing the data rate, congestion causes goodput to fall off in a similar fashion on both testbeds, which is good, but only when ignoring mintroute ill-behaving for low rates on MoteLab, which is bad. Accounting for differences in communication hardware is necessary, but even then results should be taken with a grain of salt. This certainly holds for TOSSIM simulation results, since we found that they generally do not match those of physical testbeds","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"64 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":"123373834","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 Cost of Security: Performance of ZigBee Key Exchange Mechanism in an 802.15.4 Beacon Enabled Cluster","authors":"Moazzam Khan, Fereshteh Amini, J. Misic, V. Mišić","doi":"10.1109/MOBHOC.2006.278668","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278668","url":null,"abstract":"The IEEE 802.15.4 specification is a recent low data rate wireless personal area network standard. While basic security services are provided for, there is a lack of more advanced techniques which are indispensable in modern personal area network applications. In addition, performance implications of those services are not known. In this paper, we describe a secure data exchange protocol based on the ZigBee specification and built on top of 802.15.4 link layer. This protocol includes a key exchange mechanism. Then, we evaluate the overhead of this scheme under different application scenarios. Initial results show the range of network and traffic parameters wherein the proposed scheme is feasible to use","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":"116908749","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":"C4W: An Energy Efficient Public Key Cryptosystem for Large-Scale Wireless Sensor Networks","authors":"Qi Jing, Jian-bin Hu, Zhong Chen","doi":"10.1109/MOBHOC.2006.278660","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278660","url":null,"abstract":"With hardware support and software optimization, public key cryptography (PKC) has been announced feasible on micro sensors recently. A number of experiments proved that the elliptic curve cryptography (ECC) is more suitable for resource constraint motes compared with RSA, But even ECC based protocols still cost too much energy. In this paper, we propose C4W, an identity-based public key infrastructure specially designed for wireless sensor networks (WSNs), in which all nodes can generate other's ECC public keys directly from their identities. Without certificates, no energy will be consumed for certificates communication and verification, which makes C4W especially energy efficient. C4W uses a protocol without certificates to realize mutual authentication and key agreement. Compared with a simplified SSL (SSSL) protocol using an abbreviated certificate, C4W consumes lower than 35% energy, and the communication consumption of C4W is only 28.5% of that consumed by SSSL. Furthermore, the energy analysis of C4W illuminates that the expensive public key computational cost is almost neglectable compared with the heavy communication consumption in a large-scale WSNs, which gives the asymmetric key management in WSNs a bright future","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"72 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":"133228056","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}
Wenrui Zhao, Yang-Jie Chen, M. Ammar, M. Corner, B. Levine, E. Zegura
{"title":"Capacity Enhancement using Throwboxes in DTNs","authors":"Wenrui Zhao, Yang-Jie Chen, M. Ammar, M. Corner, B. Levine, E. Zegura","doi":"10.1109/MOBHOC.2006.278570","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278570","url":null,"abstract":"Disruption tolerant networks (DTNs) are designed to overcome limitations in connectivity due to conditions such as mobility, poor infrastructure, and short range radios. DTNs rely on the inherent mobility in the network to deliver packets around frequent and extended network partitions using a store-carry-and-forward paradigm. However, missed contact opportunities decrease throughput and increase delay in the network. We propose the use of throwboxes in mobile DTNs to create a greater number of contact opportunities, consequently improving the performance of the network. Throwboxes are wireless nodes that act as relays, creating additional contact opportunities in the DTN. We propose algorithms to deploy stationary throwboxes in the network that simultaneously consider routing as well as placement. We also present placement algorithms that use more limited knowledge about the network structure. We perform an extensive evaluation of our algorithms by varying both the underlying routing and mobility models. Our results suggest several findings to guide the design and operation of throwbox-augmented DTNs","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"384 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":"123360217","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":"SENSTRAC: Scalable Querying of SENSor Networks from Mobile Platforms Using TRACking-Style Queries","authors":"Stefan Pleisch, K. Birman","doi":"10.1504/IJSNET.2008.019009","DOIUrl":"https://doi.org/10.1504/IJSNET.2008.019009","url":null,"abstract":"Future applications running on mobile platforms will sometimes need to query sensors and track sensor data over time. This paper uses the publish-subscribe paradigm as a natural solution to querying sensors from mobile platforms, and proposes a scalable approach to implement publish-subscribe, driven by the querying application. Our approach is evaluated by simulation, focusing on scalability","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"18 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113941143","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 Tracking Attack in Ad hoc Networks based on Topology Information","authors":"S. Chapkin, B. Bako, F. Kargl, E. Schoch","doi":"10.1109/MOBHOC.2006.278667","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278667","url":null,"abstract":"Unlike in conventional networks, node positions in mobile ad hoc networks (MANETs) usually change over time. As a side effect of managing routes, routing protocols to some extent also disseminate neighborship and topology information in the network, thereby disclosing at least some information on a node's own position to other nodes. Due to the wireless nature of ad hoc networks, this information can become available even to third parties which are not participating in the network. Using this information, location profiling may become possible, where attackers gather information on node positions or mobility patterns. This information may then be used for anything ranging from targeted advertisement to criminal activities. Therefore, location privacy is an important issue in ad hoc networks. In this paper, we analyze to what extent an attacker can track the precise location of a node, assuming a powerful attacker model where an attacker knows all neighbor relationships plus information on node distances. We present a new approach which uses these information and uses geometric constraints and heuristics to find node positions efficiently. The quality of our results is discussed and compared to other approaches. Based on the localization precision that such an \"omniscient\" attacker can reach, we will be able to evaluate the quality of future, more realistic attack models","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"24 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":"128146331","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":"Fair Scheduling for Hybrid Mesh Network Interconnecting Video Sensors","authors":"Ki-Dong Lee, Victor C. M. Leung","doi":"10.1109/MOBHOC.2006.278647","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278647","url":null,"abstract":"In this paper, we consider deployment of a wireless mesh network (WMN) to interconnect a video sensor network (VSN) and improve its energy efficiency. We propose a scheduling method for mesh nodes that performs fair scheduling if there is sufficient link capacity, and perform traffic grooming followed by scheduling using a novel constraint relaxation method if link capacity is insufficient. The resulting improvement in energy efficiency of the VSN is evaluated. Results show remarkable savings in power consumption of sensor nodes when a VSN is interconnected with a WMN: energy consumption in the VSN is reduced by approximately 55-79% when the probability that a sensor node can forward traffic to a mesh node is 50%","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"81 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":"132660367","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}