{"title":"Efficient and robust multicast routing in mobile ad hoc networks","authors":"Ravindra Vaishampayan, J. Garcia-Luna-Aceves","doi":"10.1109/MAHSS.2004.1392169","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392169","url":null,"abstract":"We present the protocol for unified multicasting through announcements (PUMA) in ad-hoc networks, which establishes and maintains a shared mesh for each multicast group, without requiring a unicast routing protocol or the preassignment of cores to groups. PUMA achieves a high data delivery ratio with very limited control overhead, which is almost constant for a wide range of network conditions. Using simulations in Qualnet 3.5, we compare PUMA with ODMRP and MAODV, which are representatives of mesh-based and tree-based multicast routing in ad hoc networks. The results from a wide range of scenarios of varying mobility, group members, number of senders, traffic load, and number of multicast groups show that PUMA attains higher packet delivery ratios than ODMRP and MAODV, while incurring far less control overhead.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129114247","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":"Joint synchronization, routing and energy saving in CSMA/CA multi-hop hybrid networks","authors":"D. Jurca, J. Hubaux","doi":"10.1109/MAHSS.2004.1392163","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392163","url":null,"abstract":"Multi-hop hybrid networks can help providing both high bandwidth and broad coverage for wireless data networks. We focus on CSMA/CA-based networks and take IEEE 802.11 as a concrete example. We show that the three fundamental operations of synchronization, routing and energy saving can be implemented in an integrated way. Our integrated solution is based on the periodic computation of a broadcast tree among the nodes reporting to the same access point, starting from the access point itself. We use the nodes that are tree vertices as relays for both data and control packets. We propose a distributed neighbor discovery protocol and a simple centralized algorithm for computing the broadcast tree. Our analysis and simulation results show that the proposed solution has low protocol overhead in terms of message passing and execution time, and performs well even if nodes are mobile.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125939730","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":"Efficient construction of connected dominating set in wireless ad hoc networks","authors":"B. Han, H. Fu, Lidong Lin, W. Jia","doi":"10.1109/MAHSS.2004.1392211","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392211","url":null,"abstract":"Connected dominating set based routing is a promising approach for enhancing the routing efficiency in wireless ad hoc networks. However, finding the minimum dominating set in an arbitrary graph is a NP-hard problem. We propose a simple and efficient distributed algorithm for constructing a connected dominating set in wireless ad hoc networks with time complexity O(n) and message complexity O(nlog n). The dominating set generated with our algorithm can be more reliable and load balanced for routing as compared with some well-known algorithms. The simulation results demonstrate that our algorithm outperforms previous work in terms of the size of the resultant connected dominating set.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"180 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125822206","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":"An adaptive mobility-aware MAC protocol for sensor networks (MS-MAC)","authors":"H. Pham, S. Jha","doi":"10.1109/MAHSS.2004.1392207","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392207","url":null,"abstract":"Most of the MAC protocols proposed for wireless sensor networks assume sensors to be stationary after deployment. This usually provides very bad network performance in scenarios involving mobile sensors. Handling mobility in wireless sensor networks in an energy-efficient way is a new challenge. Techniques developed for other mobile networks, such as mobile phone or mobile ad hoc networks, cannot be applicable, as in these networks, energy is not a very critical resource. The paper presents a new adaptive mobility-aware MAC protocol for sensor networks (MS-MAC). The protocol uses any change in received signal level as an indication of mobility and, when necessary, triggers the mobility handling mechanism. In this way, the new mobility-aware MAC protocol can work in a very energy-efficient way when the network is stationary, whereas it can maintain some level of network performance when there are mobile sensors.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123159005","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":"Protocol-independent packet delivery improvement service for mobile ad hoc networks","authors":"Chien-Chung Shen, Sundaram Rajagopalan","doi":"10.1109/MAHSS.2004.1392215","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392215","url":null,"abstract":"This paper addresses the issue of improving packet delivery for multicast in mobile, ad hoc networks and proposes a reliability improvement mechanism called protocol-independent packet delivery improvement service (PIDIS) to recover lost packets. PIDIS is a non-persistent, best-effort reliability improvement service that exploits the mechanism of swarm intelligence to make intelligent decisions about whence to fetch the lost packets. PIDIS employs the beneficial aspects of probabilistic routing and adapts well to mobility. PIDIS achieves probabilistic reliability and, unlike other gossip-based schemes, does not need to maintain information about group members from which lost packets are retrieved. Further PIDIS does not rely on any underlying routing protocol or primitive, and can be incorporated into any (unreliable) ad hoc multicast routing protocol. Lastly, because PIDIS is non-persistent, it does not incur any overhead when there is no lost message to be recovered. We incorporated PIDIS into ODMRP, and compared it against anonymous gossip (AG) implemented over ODMRP, and ODMRP. Our simulation results show that PIDIS+ODMRP in most cases, is more efficient and performs better than AG+ODMRP and ODMRP in terms of packet delivery, end-to-end delay and MAC layer overheads. We attribute the better performance and lower MAC overheads of PIDIS+ODMRP to the efficient gossiping made possible by using swarm intelligence techniques.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130789649","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 and implementation of scalable clock synchronization protocols in IEEE 802.11 ad hoc networks","authors":"Dong Zhou, T. Lai","doi":"10.1109/MAHSS.2004.1392164","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392164","url":null,"abstract":"This paper studies a fundamental problem, clock synchronization, in IEEE 802.11 ad hoc networks. Clock synchronization is important for frequent hopping spread spectrum (FHSS) to ensure that all stations \"hop\" at the same time; it is also necessary for FHSS, direct sequence spread spectrum (DSSS) and orthogonal frequency-division multiplexing (OFDM) to perform power management. The synchronization mechanism specified in the IEEE 802.11 standards has a severe scalability problem. Remedies have been proposed to solve the scalability problem, but these solutions either can not handle mobility very well or the protocol is too experimental without solid analysis. In this paper, we analyze the root cause of the scalability problem and propose two protocols with analytical guidance for implementation. The new solutions are distributed, scalable and very adaptive to station mobility. The maximum clock drift is improved from over 4000 /spl mu/s to under 125 /spl mu/s and 50 /spl mu/s respectively for our new protocols.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130814187","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":"Hop count optimal position based packet routing algorithms for ad hoc wireless networks with a realistic physical layer","authors":"J. Kuruvila, A. Nayak, I. Stojmenovic","doi":"10.1109/MAHSS.2004.1392179","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392179","url":null,"abstract":"Existing routing and broadcasting protocols for ad hoc networks assume an ideal physical layer model. We apply the log normal shadow fading model to represent a realistic physical layer and propose a MAC layer protocol to produce the optimal shortest hop count routing scheme. We then study the optimal packet forwarding distance to minimize the hop count. A hop count optimal, greedy, localized routing algorithm (referred as ideal hop count routing (IHCR)) is then presented. We also present another algorithm called expected progress routing with acknowledgements (referred as aEPR) and then propose a projection progress scheme. In conclusion, we propose a tR-greedy routing scheme, where the packet is forwarded to the neighbor closest to the destination, among neighbors that are within distance tR. All described schemes are implemented, and their performances are evaluated and compared.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133689603","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":"Semantic internetworking of sensor systems","authors":"W. Ke, S. A. Ayyash, T. Little","doi":"10.1109/MAHSS.2004.1392189","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392189","url":null,"abstract":"Deployed wireless sensor networks are usually tightly coupled with specific tasks and therefore present unique communication needs. With technological advances that are making easy deployment of wireless sensor networks a reality, mechanisms that allow data exchange between sensor systems deployed at different times and initially for different purposes are necessary. Otherwise, sensors which are co-located and can collaborate with one another to increase capacity and/or performance may be prevented from doing so due to the inability to exchange data with one another. To this end we propose a semantic-based routing architecture that enables internetworking of sensor systems. In this architecture each sensor system can define its own address names that reflect application-level needs, but which follows a specific naming structure. Semantic routers are elected in the network and process packets based on both the address name and the naming structure. Processing is based on rules that can be modified according to changes in application-level requirements or changes in the naming structure. We describe this architecture and show that it enables easy internetworking of sensor systems deployed at different times and for different applications, enables data forwarding to only relevant regions in the network (as opposed to network-wide flooding), supports application-level communication needs, and supports hierarchical routing schemes.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129622069","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":"Localized probabilistic and dominating set based algorithm for efficient information dissemination in ad hoc networks","authors":"M. Hauspie","doi":"10.1109/MAHSS.2004.1392062","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392062","url":null,"abstract":"Ad hoc networks are autonomous dynamic networks composed of mobile devices like personal digital assistants (PDA) for instance. In such mobile networks, lack of infrastructure leads to non trivial information discovery and dissemination. A scheme in which a unique object centralizes information is not efficient for many reasons. We propose a probabilistic algorithm to distribute an information token satisfactorily among nodes forming the network by using localized data. Then, in order to limit the number of memorizing nodes, we propose to make memorizing nodes belong to a dominating set.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133376853","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":"Link probability, network coverage, and related properties of wireless ad hoc networks","authors":"Li-Hsing Yen, Chang-Wu Yu","doi":"10.1109/MAHSS.2004.1392196","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392196","url":null,"abstract":"This paper has analyzed link probability, expected node degree, expected number of links, and expected area collectively covered by a finite number of nodes in wireless ad hoc networks. Apart from the formulation of exact mathematical expressions for these properties, we have disclosed two fundamental results: (1) Every possible link has an equal probability of occurrence. (2) It is the border effects that makes two links probabilistically dependent. Simulation results show that our analysis predicts related measure with accuracy.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"398 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128858996","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}