{"title":"Extending Broadcast Lifetime in Ad Hoc Networks by Distributed and Smooth Backbone Update","authors":"I. Siomina, D. Yuan","doi":"10.1109/MOBHOC.2006.278593","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278593","url":null,"abstract":"We present an algorithm for maximizing the lifetime of broadcasting over a virtual backbone in wireless ad hoc networks. The algorithm is fully distributed in performing backbone update, and its message overhead is insensitive to the update interval. Moreover, our algorithm design guarantees backbone connectivity throughout the update process. We present simulation studies to demonstrate that the algorithm can significantly prolong lifetime","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"71 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":"124425257","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 mitigating hot spots for clustering mechanisms in wireless sensor networks","authors":"Mao Ye, E. Chan, Guihai Chen","doi":"10.1109/MOBHOC.2006.278609","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278609","url":null,"abstract":"A major issue in the design of wireless sensor networks for critical data applications is the presence of hot spots, due to the uneven consumption of energy among the sensors. In this paper we propose and evaluate a novel design which aims to create proper sized hot spots integrated with a clustering mechanism, thereby maximizing the network lifetime. We determine analytically the optimal size of the hot spot and as well as the number of clusters. Simulation results verify that our proposed design achieves our objectives","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":"134075399","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}
Jun-Bae Seo, Se-Jin Kim, Hyong-Woo Lee, Choong-Ho Cho
{"title":"An Efficient Capacity Allocation Scheme of Periodic Polling Services for a Multimedia Traffic in an IEEE802.16 System","authors":"Jun-Bae Seo, Se-Jin Kim, Hyong-Woo Lee, Choong-Ho Cho","doi":"10.1109/MOBHOC.2006.278548","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278548","url":null,"abstract":"In this paper, we consider a capacity allocation scheme of periodic polling services for a multimedia traffic in an IEEE 802.16 system. In the scheme of our interest, a base station assigns a subscriber station contiguous M uplink subframes for uplink traffic transmission and v vacation frames for saving power and opportunities for other subscriber stations. Among M uplink subframes, the subscriber station returns its remaining frames, when its queue is empty. The returned bandwidth will then be allocated to other subscriber stations. We carry out an analysis on this queueing system, by using a generating function approach. The performance of the proposed capacity allocation scheme is presented in terms of the first moment of queue length, the mean vacation and transmission period. We also compare its performance with that of a deterministic capacity allocation scheme, in which allocated bandwidth would not be returned","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"35 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":"133139970","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 Mobile-Agent-Based Collaborative Framework for Sensor Network Applications","authors":"P. Biswas, H. Qi, Yingyue Xu","doi":"10.1109/MOBHOC.2006.278628","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278628","url":null,"abstract":"In this paper, we present a multi-layered, middleware-driven, multi-agent, interoperable architecture for distributed sensor networks, that bridges the gap between the programmable application layer consisting of software agents and the physical layer consisting of extremely small, low power devices that combine programmable computing with sensing, tracking and wireless communication capabilities. We develop an energy-efficient approach for collaborative processing among multiple sensor nodes using a mobile-agent-based computing model. Unlike the traditional client/server-based model where each sensor node sends data to the sink, in this model the sink/base-station deploys mobile agents that migrate from node to node following a certain itinerary and fuses the information/data locally at each node. This way, the intelligence is distributed throughout the network edge and communication cost is reduced to make the sensor network energy-efficient. Simulation results show that the mobile-agent-based approach is advantageous for large distributed sensor network environment","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"54 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":"132177497","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":"QoS Provision for Remote Sensing and Control in Heterogeneous Environments","authors":"Zhiwei Cen, M. Mutka","doi":"10.1109/MOBHOC.2006.278620","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278620","url":null,"abstract":"In a heterogeneous wireless network environment, the network nodes are equipped with both wireless local area network (WLAN) and cellular interfaces. It is desirable to combine the higher bandwidth of a WLAN and the ubiquitous nature of cellular networks to provide the transport service for QoS demanding applications, such as remote sensing and control systems. Common solutions exploit the diversity of cellular channels by recruiting multiple WLAN peers to work as proxies for a MANET node that needs to communicate through the cellular network. One important problem when utilizing channel diversity in a heterogeneous wireless network environment is to balance the trade-off of channel diversity gains with MANET peer contentions. A greater number of proxies will inevitably increase the MANET contention and possibly QoS degrading of the cell, and fewer proxies may not be able to provide sufficient diversity. This paper aims to build a dynamic mechanism to determine the appropriate number of proxies to use. The mechanism uses the MAC layer retransmission rate as an indicator of the contention level in MANET. Simulation using cellular channel fading models and prevalent cell scheduling policies indicate the scheme can provide better QoS through channel diversity by using the appropriate number of proxies","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"2 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":"129217390","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":"SoNEA: Sensing Online Novelty Using Event Archives","authors":"A. Teredesai, Yuanfeng Zhu","doi":"10.1109/MOBHOC.2006.278622","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278622","url":null,"abstract":"Event detection and consequently novelty detection on time series data has recently attracted increasing attention from the computing community. In this paper, we describe a system that can detect novel events in wireless sensor networks termed SoNEA (sensing online novelty using event archives). This system is able to receive and process sensory data from sensor networks and dynamically detect novel events using intelligent novelty detection techniques. The detection is based on clustering techniques combined with cognitively motivated habituation theory. A novel scheme to predict missing values of sensor readings is also proposed based on this system. The results of the experiments exhibiting the performance of the proposed solution in detecting novel events and missing value predication are reported","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"41 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":"116090460","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":"Quality of Service Routing and Admission Control for Mobile Ad-hoc Networks with a Contention-based MAC Layer","authors":"L. Hanzo, R. Tafazolli","doi":"10.1109/MOBHOC.2006.278594","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278594","url":null,"abstract":"In mobile ad hoc networks (MANETs), accurate throughput-constrained quality of service (QoS) routing and admission control have proven difficult to achieve, mainly due to node mobility and contention for channel access. In this paper we propose a solution to those problems, utilising the dynamic source routing (DSR) protocol for basic routing. Our design considers the throughput requirements of data sessions and how these are affected by protocol overheads and contention between nodes. Furthermore, in contrast to previous work, the time wasted at the MAC layer by collisions and channel access delays, is also considered. Simulation results show that in a stationary scenario with high offered load, and at the cost of increased routing overhead, our protocol more than doubles session completion rate (SCR) and reduces average packet delay by a factor of seven compared to classic DSR. Even in a highly mobile scenario, it can double SCR and cut average packet delay to a third","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"52 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":"115207309","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":"Maximizing Throughput for Queries over Streaming Sensor Data","authors":"Joseph S. Gomes, Hyeong-Ah Choi","doi":"10.1109/MOBHOC.2006.278617","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278617","url":null,"abstract":"Sensors are becoming ubiquitous, and increasingly integrated with our lives. Sensors usually send sampled data periodically using wireless connections to server machines. The servers perform various operations (e.g. filter, aggregate, join etc) on this data in real-time according to predefined queries or rules. In this paper, we address the problem of finding an optimal join tree that maximizes throughput for sliding window based multi-join queries over continuous sensor data streams. We develop a dynamic programming algorithm OptDP, that produces an optimal tree but runs in an exponential time in the number of input streams. We then present a polynomial time greedy algorithm XGreedyJoin. Our experiments in ARES show that for almost all instances, trees from XGreedyJoin perform close to the optimal trees from OptDP, and significantly better than existing XJoin based heuristic algorithms","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"16 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":"126890944","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}
Ece Gelal, G. Jakllari, S. Krishnamurthy, N. Young
{"title":"An Integrated Scheme for Fully-Directional Neighbor Discovery and Topology Management in Mobile Ad hoc Networks","authors":"Ece Gelal, G. Jakllari, S. Krishnamurthy, N. Young","doi":"10.1109/MOBHOC.2006.278551","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278551","url":null,"abstract":"With directional antennas, it is extremely important that a node maintains information with regards to the positions of its neighbors. This would allow the node to \"track\" the neighbors as they move; otherwise, a node will have to resort to either omnidirectional or circular directional transmissions (or receptions) fairly often. This can be overhead intense and can reduce spatial reuse. Maintaining directional information with regards to a large number of neighbors can itself be expensive; therefore it is important to limit a node's degree. We propose a topology control scheme (Di-ATC) that works with fully directional communications and offers a low degree bound while preserving network connectivity. The key idea is to execute Di-ATC on the discovered neighbors to select and maintain connectivity with only a subset of these neighbors. The members of this subset are those with high angular separations. We perform extensive simulations and demonstrate that our scheme effectively limits node degree while at the same time, preserves network connectivity and achieves low path stretch","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"15 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":"126069117","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":"MITECRO: a protocol for sensor networks to MInimize Total Energy consumption during each ROund of sensed data gathering","authors":"Md. Ashiqur Rahman, Obidul Islam, S. Hussain","doi":"10.1109/MOBHOC.2006.278618","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278618","url":null,"abstract":"Common applications of sensor networks include continuous monitoring where sensors are deployed over a region and the sensed data are gathered at a distant base station periodically. In each round of data gathering, our MITECRO protocol minimizes the total energy consumption of the sensor network. This may however unbalance energy consumption over all sensor nodes. As a result, few nodes may die earlier than the others. Experiments show that MITECRO nearly doubles the network lifetime compared to existing protocol that optimally balances all sensors' energy consumption. Since MITECRO cannot ensure 100% node availability throughout the network's lifetime, overall sensing coverage might be compromised. We argue that the more sensor nodes have overlapping sensing coverage, the better our protocol will perform in maximizing network lifetime without significantly compromising overall sensing coverage","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"523 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":"131869605","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}