{"title":"An optimal TDMA-based MAC scheduling for the minimum energy multicast in wireless ad hoc networks","authors":"Song Guo, O. Yang","doi":"10.1109/MAHSS.2004.1392205","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392205","url":null,"abstract":"Energy conservation is a critical issue in wireless ad hoc networks since batteries are the only limited-life energy source to power the nodes. The introduction of real-time applications has posed additional challenges. Transmission of video and imaging data requires both energy and QoS aware routing in order to ensure efficient usage of the networks. We only consider \"bandwidth\" as the QoS in TDMA-based wireless ad hoc networks that use omni-directional antennas and have limited energy resources. We present a constraint formulation model for the QoS-MEM (QoS-aware minimum energy multicast) problem in terms of mixed integer linear programming (MILP). It can be used for an optimal solution of the QoS-MEM problem, and it also provides a way to evaluate the realistic performance of different heuristic algorithms.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"133 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":"121424998","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":"Use of congestion-aware routing to spatially separate TCP connections in wireless ad hoc networks","authors":"Zhenqiang Ye, S. Krishnamurthy, S. Tripathi","doi":"10.1109/MAHSS.2004.1392178","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392178","url":null,"abstract":"Spatially separating TCP sessions such that they inflict much lower interference effects on each other may provide gains in performance. We first investigate the possibilities of achieving such gains by considering a centralized, ideal, and unrealistic congestion aware routing approach. We then consider the implementation of a distributed routing protocol to achieve the aforementioned spatial separation benefits. We find that due to practicalities such as the need for the exchange of congestion state, the existence of stale congestion information and the creation of sub-optimal paths, the benefits due to spatial separation are considerably undermined. We perform both macroscopic simulations and microscopic studies of specific constructed examples to understand the reasons and quantify the various effects with both the centralized and the distributed approaches. Our studies suggest that achieving noteworthy performance gains by spatially separating TCP sessions may be extremely difficult if not impossible in ad hoc networks.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"38 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":"122718154","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":"Scheduled persistence for medium access control in sensor networks","authors":"C. Colbourn, V. Syrotiuk","doi":"10.1109/MAHSS.2004.1392165","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392165","url":null,"abstract":"For sensor networks, throughput may not be the most important metric to optimize in medium access control. For many applications, periodic reports are desirable suggesting the need for a time division (TDMA) access scheme. However for many reasons, including nonuniformity of deployment and the large number of sensor nodes anticipated, TDMA is impractical. We explore scheduled persistence for medium access control in sensor networks. A continuum of approaches from simple randomized-persistent schedules at one extreme to topology-transparent schedules based on Steiner systems at the other are considered. We investigate the probability of obtaining a collision-free slot before a specified time (number of slots) and show that while the expected throughput of these approaches is the same, their variance is strikingly different. The schemes are also remarkably robust to high density. Furthermore, when schedules are chosen at random for each frame, scheduled persistence offers an interesting alternative for medium access control in sensor networks.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"104 6 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":"122545702","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 ad hoc on-demand routing protocol with high packet delivery fraction","authors":"Chiu-Kuo Liang, Hsi-Shu Wang","doi":"10.1109/MAHSS.2004.1392218","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392218","url":null,"abstract":"A mobile ad hoc network (MANET) is a system of wireless mobile nodes dynamically self-organizing in arbitrary and temporary network topologies. Frequent topology changes caused by node mobility make the raising of the packet delivery fraction in MANET a challenging problem. In this paper, we propose a scheme to improve packet delivery fraction of the ad hoc on-demand distance vector (AODV) protocol and compare it with the performance of several routing protocols. A variety of scenarios using a variety of pause time and size of the ad hoc network were simulated.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"8 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":"121887843","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-cost truthful multicast in selfish and rational wireless ad hoc networks","authors":"Weizhao Wang, Xiangyang Li","doi":"10.1109/MAHSS.2004.1392199","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392199","url":null,"abstract":"It is conventionally assumed that all wireless devices will follow the prescribed routing protocols without any deviation. However, the scarcity of resources in wireless devices raises a concern about this assumption. Most often, instead of faithfully following the protocols, the owners of wireless devices will try to manipulate the protocols for their own benefits. We specifically study the multicast in selfish and rational wireless ad hoc networks. By assuming that each wireless node has a private cost of forwarding data for other nodes, we first give an efficient method to construct a multicast tree, namely VMST, whose cost is a 5-approximation of the optimum multicast tree's cost for homogeneous wireless networks. We then design a truthful payment scheme that pays minimum for any relay node among all truthful payment schemes based on VMST.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"28 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":"122149971","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":"Localization of wireless sensor networks with a mobile beacon","authors":"M. Sichitiu, V. Ramadurai","doi":"10.1109/MAHSS.2004.1392104","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392104","url":null,"abstract":"Wireless sensor networks have the potential to become the pervasive sensing (and actuating) technology of the future. For many applications, a large number of inexpensive sensors is preferable to a few expensive ones. The large number of sensors in a sensor network and most application scenarios preclude hand placement of the sensors. Determining the physical location of the sensors after they have been deployed is known as the problem of localization. We present a localization technique based on a single mobile beacon aware of its position (e.g. by being equipped with a GPS receiver). Sensor nodes receiving beacon packets infer proximity constraints to the mobile beacon and use them to construct and maintain position estimates. The proposed scheme is radio-frequency based, and thus no extra hardware is necessary. The accuracy (on the order of a few meters in most cases) is sufficient for most applications. An implementation is used to evaluate the performance of the proposed approach.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"6 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":"115229476","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":"Profile-based data diffusion in mobile environments","authors":"T. Buchholz, I. Hochstatter, G. Treu","doi":"10.1109/MAHSS.2004.1392210","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392210","url":null,"abstract":"People on the move often are interested in information about their close proximity. This information can either be retrieved from static nodes or other mobile nodes spreading information via wireless technologies. This approach to data diffusion potentially overloads the mobile device if no filtering is applied. Filtering mechanisms, however, cannot rely on the existence of a common information model among the peers. We present an approach for profile-based filtering which does not require shared knowledge among the nodes. Instead, our system can translate between competing taxonomies. It uses synonyms and a tolerant search algorithm to cope with morphological and lexical variations and structural differences of the taxonomies. A prototype of our approach was implemented and successfully tested.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"52 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":"129166744","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 performance comparison of protocols for clustering and backbone formation in large scale ad hoc networks","authors":"S. Basagni, M. Mastrogiovanni, C. Petrioli","doi":"10.1109/MAHSS.2004.1392076","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392076","url":null,"abstract":"This work concerns the comparative performance evaluation of protocols for clustering and backbone formation in ad hoc networks characterized by a large number of resource-constrained nodes. A typical example of these networks are wireless sensor networks. The DCA protocol represents those protocols whose backbone construction method is based on selecting nodes as clusterheads and then joining them to form a connected backbone. The algorithm proposed by Wu and Li has been chosen to exemplify those algorithms that build a connected backbone and then prune away redundant nodes. Finally, the algorithm by Wan et al. has been considered here for its more theoretical properties of producing a backbone with a constant approximation factor, linear time complexity and optimal message complexity. In order to obtain a backbone reasonably small at reasonable cost we propose an enhancement of the DCA algorithm, termed DCA-S, which enriches the DCA backbone construction with a recently proposed and resource effective sparsification rule. DCA-S leads to a robust backbone close in size to that generated by the Wan et al. protocol without significantly degrading the performance in terms of all the other relevant metrics.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"25 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":"122026037","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":"Optimizing a class of in-network processing applications in networked sensor systems","authors":"Bo Hong, V. Prasanna","doi":"10.1109/MAHSS.2004.1392094","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392094","url":null,"abstract":"A key application of networked sensor systems is to detect and classify events of interest in an environment. Such applications require processing of raw data and the fusion of individual decisions. In-network processing of the sensed data has been shown to be more energy efficient than the centralized scheme that gathers all the raw data to a (powerful) base station for further processing. We formulate the problem as a special class of flow optimization problem. We propose a decentralized adaptive algorithm to maximize the throughput of a class of in-network processing applications. This algorithm is further implemented as a decentralized in-network processing protocol that adapts to any changes in link bandwidths and node processing capabilities. Simulations show that the proposed in-network processing protocol achieves up to 95% of the optimal system throughput. We also show that path based greedy heuristics have very poor performance in the worst case.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"78 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":"116010119","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":"Power aware coding for spatio-temporally correlated wireless sensor data","authors":"C. Tang, C. Raghavendra, V. Prasanna","doi":"10.1109/MAHSS.2004.1392091","DOIUrl":"https://doi.org/10.1109/MAHSS.2004.1392091","url":null,"abstract":"A novel coding scheme is proposed for applications over wireless microsensor networks to meet both wireless link bandwidth and node energy constraints. First, an analysis is performed on the energy efficiency of coding schemes in wireless microsensor networks. Based on this analysis, we devise a power aware coding scheme, called EESPIHT which exploits the spatio-temporal correlation of multiple sensor readings. It is also made resilient to channel errors: it selects an error correcting code based on source coding information and transmission power so that energy dissipation is minimized. Experimental results on a LINUX implementation and simulation results based on OPNET using field data sets show that the proposed scheme can reduce energy on communication by more than 60% and maintain a signal-to-noise ratio (SNR) gain of 24 dB or better compared to the non-coded case.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"33 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":"131954129","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}