{"title":"Wireless Mesh Network Testbed Demo","authors":"L. Iannone, Konstantin Kabassanov, S. Fdida","doi":"10.1109/MOBHOC.2006.278615","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278615","url":null,"abstract":"The success of the IEEE 802.11 standard has pushed the research community to put a not negligible effort in the design, analysis, and development of new wireless solutions during the last decade. More recently, the apparition of the wireless mesh technology incited a number of wireless testbeds to be deployed in several countries, in both academic and industrial environments. The LIP6 laboratory of the Universite Pierre et Marie Curie is a main actor in the context of wireless mesh networking and has deployed its own testbed. Custom wireless routers built up from off-the-shelf hardware and open source software form this testbed, which is called MeshDVNet. On this platform the LIP6 has designed and implemented the MeshDV demon, an integrated approach for routing and mobility management, which hides to end-users all the complexity of wireless mesh networks. MeshDV allows end-users to easily access the network without the constrain of embedding any kind of additional software (e.g. routing demon, protocol stack extensions)","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"2003 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":"125778514","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":"SaFT: Reliable Transport in Mobile Networks","authors":"Simon Heimlicher, R. Baumann, M. May, B. Plattner","doi":"10.1109/MOBHOC.2006.278588","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278588","url":null,"abstract":"End-to-end transport protocols perform poorly in mobile environments, primarily due to the frequent route breaks induced by node mobility. We present a framework for hop-by-hop transport protocols and propose a new reliable transport protocol: SaFT (store-and-forward transport). We evaluate its performance in mobile ad hoc networks vis-a-vis TCP. Overall, SaFT achieves up to 3 times faster delivery of messages in such networks. We conclude that store-and-forward protocols are suited well to provide reliable communication in mobile ad hoc networks","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"72 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":"127170212","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":"Implementing Agreement Protocols in Sensor Networks","authors":"Andreas Achtzehn, Z. Benenson, C. Rohner","doi":"10.1109/MOBHOC.2006.278665","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278665","url":null,"abstract":"We investigate application of agreement protocols tolerating malicious failures in sensor networks. We identify several scenarios where agreement can be used, and report on our experience with implementing an agreement protocol. The ultimate goal is to implement a secure and energy-efficient agreement protocol for sensor networks","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":"123318567","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":"Cross-Layer Discovery and Routing in Reconfigurable Wireless Networks","authors":"C. Julien, Meenakshi Venkataraman","doi":"10.1109/MOBHOC.2006.278549","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278549","url":null,"abstract":"This work addresses the need for application-aware adaptive communication in mobile ad hoc networks that creates network routes based on applications' dynamic resource requests. We introduce an intuitive generalization to source routing which facilitates discovery of a resource in a mobile ad hoc network and the creation and maintenance of a route from the requesting host to the discovered destination. We thus eliminate the requirement that existing routing protocols be coupled with a name or resource resolution protocol, instead favoring an entirely reactive approach to accommodate significant degrees of mobility and uncertainty. We also present a performance evaluation and a comparison to existing alternatives","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"17 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":"126491735","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":"Robust Estimation and Detection in Ad Hoc and Sensor Networks","authors":"T. Roosta, S. M. Mishra, A. Ghazizadeh","doi":"10.1109/MOBHOC.2006.278562","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278562","url":null,"abstract":"Interest in robust detection and estimation in the presence of lying nodes has assumed importance in a number of applications. In this paper we motivate the robust detection and estimation problem using recent results for cooperative sensing in cognitive radios and multi-object tracking in sensor networks. As a first step, we formulate an abstract version of the problem that is solved under different assumptions. We use expectation maximization (EM) framework to successfully weed out the lying nodes. We consider different types of lying behavior. In the simplistic case of liars behaving the same over all observations. In the more complex cases, the lying behavior of the users changes over time. The solution to the problem of detection in the presence of lying nodes has been developed from two view points. In the first case we consider the binary variable being detected as a latent variable, and in the second case we consider the binary variable as a parameter. The results under the two schemes are presented and compared. In all of the cases considered in this paper, we show that the factors that maximally impact the estimation/decision process are the mean of the liars, the variance of the channel, and the number of observations","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"732 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":"116072070","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":"Adaptation of On-line Scheduling Strategies for Sensor Network Platforms","authors":"C. Decker, T. Riedel, E. Peev, M. Beigl","doi":"10.1109/MOBHOC.2006.278603","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278603","url":null,"abstract":"Current sensor network platforms perform multiple processes including sensor sampling, communication, and various computational tasks. When deployed in unpredictable environments, complex schedules of those processes may arise. Typical sensor network qualities like periodic sampling of sensors, avoidance of process starvation and automatic energy management are required to be maintained in such situations. We propose a scheduling framework for senor nodes consisting of a scheduler, a dispatcher and a controller for an on-line adaptation of the process execution. The key components are a controller and an enhanced dispatcher implementing strategies like jitter correction and starvation avoidance. Further, the framework is aware of the energy consumption of sensors. We show that our controlled scheduling framework performs significantly better than a non-controlled single scheduler in unpredictable environments. Our proposed measures are efficient to implement. Results are shown by extensive simulations and a first implementation on the particle computer platform","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"102 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":"116707661","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":"Virtual Ruler: Mobile Beacon Based Distance Measurements for Indoor Sensor Localization","authors":"Chen Wang, Yong Ding, Li Xiao","doi":"10.1109/MOBHOC.2006.278572","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278572","url":null,"abstract":"In sensor localization, ultrasound based distance measurements will have large errors if line-of-sight paths are blocked between pairwise sensors. Because these outliers, once mixed together with other correct distance measurements, are difficult for localization algorithms to identify, we propose to exclude the outliers in the first step of distance measurement. Although the distance between pairwise sensors measured by ultrasound can have multiple values due to the multipath effect, our experiments find that a sensor's incorrect position, estimated from the distance measurement along a reflected path instead of a straight line, is always mirrored to the sensor's correct position. Based on this phenomena, we propose to use mobile beacons to measure the distance between pairwise sensors from multiple perspectives and filter incorrect values through a statistical approach. Our performance evaluation shows that the proposed algorithm can achieve better localization results than previous approaches in an indoor environment where multipath effects cannot be avoided","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"25 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":"125044945","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":"Deterministic Data Reduction in Sensor Networks","authors":"Hüseyin Akcan, Hervé Brönnimann","doi":"10.1109/MOBHOC.2006.278602","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278602","url":null,"abstract":"The processing capabilities of wireless sensor nodes enable to aggregate redundant data to limit total data flow over the network. The main property of a good aggregation algorithm is to extract the most representative data by using minimum resources. From this point of view, sampling is a promising aggregation method, that acts as surrogate for the whole data, and once extracted can be used to answer multiple kinds of queries (such as AVG, MEDIAN, SUM, COUNT, etc.), at no extra cost. Additionally, sampling also preserves the correlation info within multi-dimensional data, which is quite valuable for further data mining. In this paper, we propose a novel, distributed, weighted sampling algorithm to sample sensor network data and compare to an existing random sampling algorithm, which to the best of our knowledge is the only algorithm to work in this kind of setting","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"29 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":"134297350","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}
G. Coulson, R. Gold, M. Lad, C. Mascolo, L. Mottola, G. Picco, S. Zachariadis
{"title":"Dynamic Reconfiguration in the RUNES Middleware","authors":"G. Coulson, R. Gold, M. Lad, C. Mascolo, L. Mottola, G. Picco, S. Zachariadis","doi":"10.1109/MOBHOC.2006.278613","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278613","url":null,"abstract":"Next generation embedded systems will be composed of large numbers of heterogeneous devices. These will typically be resource-constrained, will use different operating systems, and will be connected through different types of network interfaces. Additionally, they may be mobile and/or form ad-hoc networks with their peers, and will need to be adaptive to changing conditions based on context-awareness. As an example of these system we consider disaster recovery scenarios where large numbers of different devices need to interconnect in an ad-hoc manner. In this respect, our goal is the provisioning of a middleware framework for such system environments. Our approach is based on a small and efficient middleware kernel supporting highly modularised and customisable component-based middleware services. These services can be tailored for specific embedded environments, and are runtime-reconfigurable to support adaptivity. This paper describes a demonstration that highlights some of the features available in our middleware. In particular, we focus on heterogeneity handling by showing our middleware running on resource-rich as well as resource-constrained devices, and on adaptivity features by demonstrating runtime reprogramming and on-the-fly component deployment","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"86 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":"116018148","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":"Optimal Placement of Wireless Sensor Nodes with Fault Tolerance and Minimal Energy Consumption","authors":"S. Chaudhry, V. Hung, R. Guha","doi":"10.1109/MOBHOC.2006.278621","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278621","url":null,"abstract":"In this paper, an evolutionary algorithm is presented to develop a solution for the variable radii sensor placement optimization problem. Sensor nodes are placed in a sensor field such that maximum coverage of the target region is achieved. Coverage is defined in terms of monitoring points of interest. In point coverage, it is desired to place the sensor nodes such that certain target points in the area to be monitored are efficiently covered. The sensors are assumed to have varying communication and sensing radii within specified ranges. To attain a certain degree of fault tolerance, the network is required to have k-connectivity. Therein, the challenge lies in finding a solution that provides the optimal choice and arrangement of sensor nodes with a minimized overall energy consumption. Our devised algorithm places the sensors to form an energy-efficient and fault tolerant network that provides coverage of the given query points","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"76 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":"116156272","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}