Aravind B. Mohanoor, S. Radhakrishnan, V. Sarangan
{"title":"Interference aware multi-path routing in wireless networks","authors":"Aravind B. Mohanoor, S. Radhakrishnan, V. Sarangan","doi":"10.1109/MAHSS.2008.4660046","DOIUrl":"https://doi.org/10.1109/MAHSS.2008.4660046","url":null,"abstract":"We can improve the end-to-end throughput between a sender and receiver in a wireless network using multiple paths which do not interfere with each other. Given that the problem of finding such paths is computationally hard, the paper focuses on finding multiple paths which may have interference between them, but still are able to obtain the maximum possible throughput. It is achieved by observing that the pattern of interference is more important than the number of interfering links. The nature of path sets with non-destructive interference is discussed and based on these observations, combinatorial techniques for finding interference aware disjoint paths in a wireless network are presented. Simulation results indicate that the proposed solutions achieve throughputs that are significantly higher than the established theoretical results.","PeriodicalId":310422,"journal":{"name":"2008 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115613749","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":"Prototype of a social networking application in a multi-hop autonomous ad hoc network","authors":"Nathan Smith, J. Bonta","doi":"10.1109/MAHSS.2008.4660081","DOIUrl":"https://doi.org/10.1109/MAHSS.2008.4660081","url":null,"abstract":"This demo presents an application providing unique social networking and connectivity applications in a multi-hop mobile ad hoc network including peer-to-peer text messaging, push and pull photo sharing, bi-directional VoIP and near-real-time streaming video. These services are provided in an ad hoc network in which all stations are considered peers and no infrastructure is available for assistance. The demo further shows an important aspect of ad hoc networks, that of multi-hop range extension.","PeriodicalId":310422,"journal":{"name":"2008 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114671396","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":"Cost-effective multidimensional publish/subscribe services in sensor networks","authors":"D. Tran, Cuong H. Pham","doi":"10.1109/MAHSS.2008.4660093","DOIUrl":"https://doi.org/10.1109/MAHSS.2008.4660093","url":null,"abstract":"Publish/subscribe services are natural applications of sensor networks as sensors are designed mainly to detect and notify upon events of interest. To enable these services, the brokerage mechanism that routes a given event to the subscribing nodes must be confined to the networkpsilas resource constraints. GHT has been used as a cost-effective way to disseminate subscriptions and events to the sensor network. It is, however, efficient only for exact-match subscriptions. We propose an efficient GHT-like technique for both exact-match and range subscriptions where the data space can be of any dimension.","PeriodicalId":310422,"journal":{"name":"2008 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120958907","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}
O. Akribopoulos, Dimitrios Bousis, D. Efstathiou, Haris Koutsouridis, Marios Logaras, Andreas Loukas, Alexandros Nafas, G. Oikonomou, Irini Thireou, N. Vasilakis, P. Kokkinos, Georgios Mylonas, I. Chatzigiannakis
{"title":"A software platform for developing multi-player pervasive games using small programmable object technologies","authors":"O. Akribopoulos, Dimitrios Bousis, D. Efstathiou, Haris Koutsouridis, Marios Logaras, Andreas Loukas, Alexandros Nafas, G. Oikonomou, Irini Thireou, N. Vasilakis, P. Kokkinos, Georgios Mylonas, I. Chatzigiannakis","doi":"10.1109/MAHSS.2008.4660084","DOIUrl":"https://doi.org/10.1109/MAHSS.2008.4660084","url":null,"abstract":"In this paper we present a platform for developing mobile, locative and collaborative distributed games comprised of small programmable object technologies (e.g., wireless sensor networks) and traditional networked processors. The platform is implemented using a combination of JAVA Standard and Mobile editions, targeting also mobile phones that have some kind of sensors installed. We briefly present the architecture of our platform and demonstrate its capabilities by reporting two pervasive multiplayer games. The key characteristic of these games is that players interact with each other and their surrounding environment by moving, running and gesturing as a means to perform game related actions, using small programmable object technologies.","PeriodicalId":310422,"journal":{"name":"2008 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125045419","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":"Border landmark selection and applications in self-configurable wireless networks","authors":"Chong Wang, Hongyi Wu","doi":"10.1109/MAHSS.2008.4660074","DOIUrl":"https://doi.org/10.1109/MAHSS.2008.4660074","url":null,"abstract":"In this paper, we propose three algorithms for border landmark selection, namely the convex hull-based (CHB) algorithm, the center node elimination (CNE) algorithm, and the hierarchy-structured (HS) algorithm. CHB works perfectly in theory and provides a deep insight into the landmark selection problem. At the same time, it is noticed that CHB is centralized and sensitive to errors in distance estimation. The CNE algorithm is a distributed approach, devised to gradually exclude the nodes in the ldquocenterrdquo of the network till the desired number of nodes left, which are employed as landmarks. While CNE works effectively in a small network, its high order computation complexity and communication overhead may eventually lead to scalability problem when it is applied in very large networks. To address this problem, we propose the HS algorithm for striking the balance between accuracy and complexity/overhead. In HS, we establish a hierarchical structure with multiple layers, and apply the CNE algorithm in an appropriate layer to identify an initial set of candidate nodes. The outcomes are then rectified through a recursive process, yielding the final landmarks. Three applications, including coordinates establishment, border detection, and landmark-based routing in general networks without location information, are introduced based on the selected landmarks. We carry out extensive simulations to compare the performance of our landmark selection algorithms and demonstrate their effectiveness in all of the applications.","PeriodicalId":310422,"journal":{"name":"2008 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116817644","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":"GPEB: Power-efficient geographic broadcasting in sensor networks","authors":"Shibo Wu, K. Candan","doi":"10.1109/MAHSS.2008.4660091","DOIUrl":"https://doi.org/10.1109/MAHSS.2008.4660091","url":null,"abstract":"Nodes in a sensor network, operating on power limited batteries, must save power to minimize the need for battery replacement. In this paper, we study the power efficiency issues related to geographic broadcast protocols in wireless sensor networks. Specifically, we study the problems in existing flooding based and pruning based broadcast algorithm and propose a new geographic power efficient broadcast algorithm to reduce the overlaps of broadcast coverage area and thus the total power consumption. The proposed algorithm is a hybrid protocol that combines broadcasts of maximum transmission radio range and forwards of much smaller transmission radio range. Through simulation, we show that the GPEB protocol proposed in this paper can save total power consumption up to 23% compared to existing geographic broadcast protocols.","PeriodicalId":310422,"journal":{"name":"2008 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114024359","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":"Energy-based task load balancing in wireless sensor networks","authors":"H. AbdelSalam, S. Olariu","doi":"10.1109/MAHSS.2008.4660122","DOIUrl":"https://doi.org/10.1109/MAHSS.2008.4660122","url":null,"abstract":"We investigate how to maximize network lifetime by devising a task assignment protocol that balances task load on sensors based on their remaining energy. First, we show that energy-unaware protocols can excessively assign tasks to a set of sensors more than others. Consequently, the energy of those heavily loaded sensors will be depleted much faster than lightly loaded ones. This results in reducing network density around heavily loaded sensors and eventually creates energy holes that isolate the network into separated islands. This kind of behavior has its negative impacts on network durability and reliability. To avoid these problems, we propose a management protocol that assigns tasks to sensors based on their remaining energy so that energy consumption is almost even among network sensors.","PeriodicalId":310422,"journal":{"name":"2008 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133253333","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 the cooperation strategies in mobile ad hoc networks","authors":"Ze Li, Haiying Shen","doi":"10.1109/MAHSS.2008.4660129","DOIUrl":"https://doi.org/10.1109/MAHSS.2008.4660129","url":null,"abstract":"In mobile ad hoc network, all the packets are forwarded in a multi-hop fashion relying on the contribution of each participants. In order to encourage the cooperation between the nodes in the system, many incentive mechanisms have been proposed. Although these incentive schemes can improve the cooperation to some certain extend, they are still suffering from some drawbacks. In this paper, the efficiency of these incentive mechanisms has been analyzed based on game theory modules. Their performances have also been compared with a proposed hybrid cooperation enforcement mechanism ARM. The simulation and theoretical results show the superiority of the ARM over traditional reputation based scheme and price-based scheme.","PeriodicalId":310422,"journal":{"name":"2008 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115908808","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}
Dazhi Chen, B. Kumar, C. Mohan, K. Mehrotra, P. Varshney
{"title":"In-network path planning for distributed sensor network navigation in dynamic environments","authors":"Dazhi Chen, B. Kumar, C. Mohan, K. Mehrotra, P. Varshney","doi":"10.1109/MAHSS.2008.4660043","DOIUrl":"https://doi.org/10.1109/MAHSS.2008.4660043","url":null,"abstract":"We propose a set of distributed algorithms for in-network path planning that enables a distributed sensor network navigation service in dynamic environments. Different from existing algorithms that use frequent or periodic flooding, our algorithms exploit geographic information of sensors to construct and maintain navigation links. Based on a partial reversal method of directed acyclic graphs, our algorithms ensure that each source sensor has at least one safe navigation path to one of the multiple destination sensors.","PeriodicalId":310422,"journal":{"name":"2008 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"456 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125798015","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":"OPERA: Opportunistic packet relaying in disconnected Vehicular Ad Hoc Networks","authors":"Mahmoud Abuelela, S. Olariu, I. Stojmenovic","doi":"10.1109/MAHSS.2008.4660077","DOIUrl":"https://doi.org/10.1109/MAHSS.2008.4660077","url":null,"abstract":"Vehicular ad hoc networks (VANET) have recently received increasing attention in the media. And with good reason: VANET promises to integrate driving into a ubiquitous and pervasive network that will redefine the way we live and work.","PeriodicalId":310422,"journal":{"name":"2008 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124594207","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}