Jiwei Chen, Helen Zhou, Yeng-Zhong Lee, M. Gerla, Y. Shu
{"title":"AODV-DFR: Improving Ad Hoc Routing Scalability to Mobility and Load","authors":"Jiwei Chen, Helen Zhou, Yeng-Zhong Lee, M. Gerla, Y. Shu","doi":"10.1109/MOBHOC.2006.278607","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278607","url":null,"abstract":"This paper presents AODV-DFR, a hybrid routing scheme that gracefully integrates the characteristics of on-demand and proactive routings. AODV-DFR shows great scalability for mobility and traffic load. We have demonstrated that AODV-DFR outperforms on-demand routing protocols (such as AODV), georoutings (such as GPSR) and adaptive hybrid routing protocols (such as ADV) in high mobility and traffic load. The improvement is more significant with higher mobility and traffic load. AODV-DFR sustains high packet delivery rates far beyond the saturating points for other routing protocols","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"75 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":"126191556","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":"ODAR: On-Demand Anonymous Routing in Ad Hoc Networks","authors":"Denh Sy, Rex Chen, L. Bao","doi":"10.1109/MOBHOC.2006.278565","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278565","url":null,"abstract":"Routing in wireless ad hoc networks are vulnerable to traffic analysis, spoofing and denial of service attacks due to open wireless medium communications. Anonymity mechanisms in ad hoc networks are critical security measures used to mitigate these problems by concealing identification information, such as those of nodes, links, traffic flows, paths and network topology information from harmful attackers. We propose ODAR, an On-Demand Anonymous Routing protocol for wireless ad hoc networks to enable complete anonymity of nodes, links and source-routing paths/trees using Bloom filters. We simulate ODAR using J-Sim, and compare its performance with AODV in certain ad hoc network scenarios","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"84 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":"128365090","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}
Xiangyang Li, H. Chen, Y. Shu, Xiaowen Chu, Yanwei Wu
{"title":"Energy Efficient Routing With Unreliable Links in Wireless Networks","authors":"Xiangyang Li, H. Chen, Y. Shu, Xiaowen Chu, Yanwei Wu","doi":"10.1109/MOBHOC.2006.278553","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278553","url":null,"abstract":"Energy efficient routings and power control techniques in wireless networks have drawn considerable research interests recently. In this paper, we address the problem of energy efficient reliable routing in wireless networks in the presence of unreliable communication links or devices or lossy wireless link layers by integrating the power control techniques into the energy efficient routing. We study both the case when the link layer implements a perfect reliability and the case when the reliability is implemented through the transport layer, e.g., TCP. We study the energy efficient unicast when the links are unreliable. Subsequently, we study how to perform power control (thus, controlling the reliability of each communication link) such that the unicast routings use the least power when the communication links are unreliable. We presented both centralized algorithms and distributed algorithms for all the questions we studied. We conducted extensive simulations to study the power consumption, the end-to-end delay, and the network throughput of our protocols compared with existing protocols","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"26 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113977225","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":"Analysis of Bottleneck Delay and Throughput in Wireless Mesh Networks","authors":"Xiaobing Wu, Jiangchuan Liu, Guihai Chen","doi":"10.1109/MOBHOC.2006.278648","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278648","url":null,"abstract":"Wireless mesh networking has emerged as a promising technology in providing economical and scalable broadband Internet accesses. A wireless mesh network consists of mesh routers and mesh clients, connected in an ad hoc manner via wireless links. A subset of the mesh routers, referred to as gateway nodes, are capable of external Internet connections. Since other mesh routers and clients have to access the Internet through the gateway nodes, these nodes can easily become bottlenecks in the network. In this paper, we present a novel queuing model based analysis of the delay and throughput of the gateway nodes. Our simulation results suggest that the analytical results are quite accurate, which provides an effective guideline for gateway-related design and optimization in wireless mesh networks","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-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129783213","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":"Lifetime Enhancement of Wireless Sensor Networks by Differentiable Node Density Deployment","authors":"Demin Wang, Yi Cheng, Yun Wang, D. Agrawal","doi":"10.1109/MOBHOC.2006.278606","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278606","url":null,"abstract":"A wireless sensor network (WSN) is composed of wireless sensors using batteries with energy constraints, which limits the network lifetime. How to maximize the network lifetime is an important issue in the design of WSNs. We establish a relationship between node density and network lifetime in a periodically data delivery scenario of WSNs with sensors transmitting data to the sink node periodically. Based on our analysis, we propose a sensor node density deployment method that could implement a differential node density in WSNs so that the lifetime of the network could be maximized. Both theoretic analysis and simulation results show that our method outperforms the uniform node distribution method in terms of the network lifetime","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"5 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":"129181460","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":"Distributed Topology Control for Stationary and Mobile Ad Hoc Networks","authors":"Liang Zhao, E. Lloyd","doi":"10.1109/MOBHOC.2006.278600","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278600","url":null,"abstract":"In this paper a distributed topology control for stationary and mobile ad hoc networks is described. A topology control algorithm is aimed at maintaining connectivity in a mobile network while minimizing power consumption under the MinMax objective. The algorithm is proactive so that the network connectivity is guaranteed at any time instant. In regard to the topology of the graph induced by the power assignments to the network nodes, the most common objective and the objective considered in this paper is that the network be connected","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"92 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132476900","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":"Low Overhead and Scalable Proxied Adaptive Gateway Discovery for Mobile Ad Hoc Networks","authors":"Francisco J. Ros, P. M. Ruiz","doi":"10.1109/MOBHOC.2006.278561","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278561","url":null,"abstract":"In the last years, many authors have addressed the problem of interconnecting mobile ad hoc networks (MANET) to the Internet, via one or more attachment points called gateways. The protocol employed to discover available gateways and set up routes to the Internet should not incur in a big overhead, due to the scarce resources of ad hoc networks. However, previous proposals do not meet this requirement either when the number of traffic sources or available gateways increases. In this paper, we develop a gateway discovery algorithm which dynamically adapts its behavior depending on the number of active traffic sources which are in the MANET. In addition, the approach employs proxies (intermediate nodes which make use of available local information) to further reduce the control overhead. A mathematical model for this algorithm and the previous approaches is provided. By means of both an analytical and a simulation-based study, our proposed scheme is shown to greatly outperform the remaining solutions in terms of overhead reduction, while it is still able to provide a high packet delivery ratio. Besides, our proposal scales well regarding the number of sources and gateways","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"28 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":"114309529","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}
Qiongqiong Zhou, Weifeng Lv, Shihui Hu, Jianbai Wang
{"title":"A Prediction-based Handover Decision for Wireless Networks","authors":"Qiongqiong Zhou, Weifeng Lv, Shihui Hu, Jianbai Wang","doi":"10.1109/MOBHOC.2006.278635","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278635","url":null,"abstract":"Future wireless must be able to integrate most different heterogeneous IP-based networks and supply the user coordinate service without a broken connection within a diverse and overlay access network environment. One of the most challenges of wireless network integration is handover decision. To select the best network considering various network attributes, we present a network evaluation method (NEM) as a genetic criterion with user preference and usual estimation standards. With NEM, our handover decision can support not only vertical handover, also horizontal handover meanwhile by comparing cells available in current network. Furthermore, we propose a new prediction algorithm (DGRAD) to predict monitoring values of each factor prior to handover execution phase which addresses more accurate input parameters into NEM junctions and provide reasonable final handover suggestions for users","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-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127620015","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 Capacity of Wireless Mesh Networks","authors":"Bassam Aoun, R. Boutaba","doi":"10.1109/MOBHOC.2006.278559","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278559","url":null,"abstract":"The use of WMNs as backbone for large wireless access networks imposes strict bandwidth requirements. It is therefore necessary to study and quantify the capacity of such systems. In this paper, we argue that the capacity of WMNs should be addressed in the context of fairness to ensure proper operation of WMNs. Among the fairness schemes, max-min fairness allows fair and efficient use of network resources. We therefore propose an algorithm for max-min capacity calculation, formulated in term of collision domains. In addition, we show how to calculate the effective load of collision domains, assuming IEEE 802.11 as the MAC protocol. We illustrate our proposed algorithm and validate our results over baseline and general topologies","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"85 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":"126717842","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":"W2TS A novel IEEE 802.11 multi-hop mesh network for tracking systems","authors":"D. Dondi, F. Bonizzi, U. Manzoli, P. Pavan","doi":"10.1109/MOBHOC.2006.278650","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278650","url":null,"abstract":"We present a novel and innovative wireless tracking system for service vehicles in areas where the vehicles position could affect people security and operational functionalities; a communication system to acquire and transmit mobile agents GPS position data to an area control station has been studied and implemented. As mobile agents (vehicles) are free to move over the operational area, the target of the system is to provide a reliable tracking service employing a wireless backbone, comprised of fixed stations. The novel solution proposed here will manage the communication between mobile agents and the backbone network with a specific AODV routing protocol, and the static backbone network with a co-existent different customized OLSR routing protocol","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"18 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":"117279672","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}