{"title":"Router Placement in Wireless Sensor Networks","authors":"M. Ahlberg, Vladimir Vlassov, T. Yasui","doi":"10.1109/MOBHOC.2006.278604","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278604","url":null,"abstract":"In this paper we propose and evaluate algorithms for placement of routers in a wireless sensor network. There are two major requirements on router placement. First, a placement must guarantee connectivity, i.e. every sensor must be able to communicate through routers with a predefined computer-connected gateway node. Second, a placement must provide robust communication in the case of router failures. This is achieved by placing redundant routers that increase the number of possible routes. Both requirements should be met by placing as few routers as possible. The proposed algorithms compute placement in an efficient and reasonably fast way","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"116 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":"124496964","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 Sharing of Sensor Networks","authors":"René Müller, G. Alonso","doi":"10.1109/MOBHOC.2006.278547","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278547","url":null,"abstract":"In this paper we tackle the problem of allowing applications to request different data at different rates from different sensors of the same sensor network while still being able to run the sensor network in an efficient manner. Our approach is to merge an arbitrary number of user queries into a network query. By doing this, traffic is minimised and the sensors have better energy consumption behavior than if all user queries would have been directly sent to the network. In the paper we describe the algorithms for the transformation of queries and the resulting data streams. We also provide an extensive performance evaluation of the algorithms using sets of over hundred overlapping user queries executing on the same sensor network","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"1 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":"130227646","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":"Over-hearing for Energy Efficient in Event-Driven Wireless Sensor Network","authors":"Hung-Cuong Le, H. Guyennet, N. Zerhouni","doi":"10.1109/MOBHOC.2006.278625","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278625","url":null,"abstract":"In this paper, we introduce a new energy efficient medium access control (MAC) protocol for event-driven sensor networks. The event-driven wireless sensor networks do not often have much data to send. When an alarm occurs, many sensors in the network send the same message at the same time. These redundant communications lead to an energy waste due to many transmissions of redundant data and collisions in the network. By using over-hearing message, we propose a new method to solve this problem in order to save energy and to maximize the lifetime of the sensor networks","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"1 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":"130611796","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}
M. Castillo-Effen, W. Moreno, M. Labrador, K. Valavanis
{"title":"Adapting Sequential Monte-Carlo Estimation to Cooperative Localization in Wireless Sensor Networks","authors":"M. Castillo-Effen, W. Moreno, M. Labrador, K. Valavanis","doi":"10.1109/MOBHOC.2006.278629","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278629","url":null,"abstract":"Localization is a key function in wireless sensor networks (WSNs). Many applications and internal mechanisms require nodes to know their location. This work proposes a new sequential estimation algorithm for distributed cooperative localization, whose simplicity makes it amenable to self-localization in wireless sensor networks (WSNs), characterized by their restricted resources in energy and computation. The algorithm is inspired in sequential Monte-Carlo estimation techniques, viz. particle filters that excel in robustness and simplicity for estimation applications. However, particle filters require significant amounts of memory and computational power for managing large numbers of particles. The presented technique reduces the number of particles, while retaining the convergence, accuracy and simplicity properties, as demonstrated in simulation experiments","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"13 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":"131880772","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 Routing Protocols for Ad Hoc Network","authors":"Saurabh Rastogi","doi":"10.1109/MOBHOC.2006.278657","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278657","url":null,"abstract":"An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. This paper evaluates some of the existing routing protocols such as dynamic source routing (DSR), ad hoc on-demand distance vector routing (AODV), destination-sequenced distance-vector (DSDV) and proposed a new protocol. An attempt has been made to compare the performance of two prominent on-demand reactive routing protocols for mobile ad hoc networks: DSR and AODV, along with the traditional proactive DSDV protocol. These protocols involve communication overheads of route maintenance and route discovery and use single route. The nodes which do not possess enough power to carry out the data delivery process should not be used in route selection. Taking into account all these parameters, a new routing protocol has been proposed. This protocol uses the concept of virtual node and the power feature of a mobile node. The scheme establishes the multiple paths without transmitting any extra control message. A simulation model with MAC and physical layer models is used to study interlayer interactions and their performance implications. The performance differentials for the existing ones are analyzed using varying network load, mobility, throughput in data delivery and network size. These simulations are carried out based on the Rice Monarch Project that has made substantial extensions to the NS-2 network simulator to run ad hoc simulations","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"1 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":"132086160","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 Optimization Framework for Rate Allocation in Wireless Multicast","authors":"A. Mohamed, H. Alnuweiri","doi":"10.1109/MOBHOC.2006.278545","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278545","url":null,"abstract":"Multicast-based data communication is an efficient communication scheme especially in multihop ad hoc networks where the MAC layer is based on one-hop broadcast from one source to multiple receivers. In this paper, we discuss a framework of rate allocation for a set of homogeneous multicast sessions over multihop wireless networks. We propose a framework that facilitates the online calculation of the optimal rates for a set of multicast sessions such that the aggregate utility for all sessions is maximized. This framework is used to steer the entire network of ad hoc nodes towards the optimal point in real time using a totally distributed and asynchronous environment settings. We present a series of implementations based on different network settings and show that not only convergence to the optimal rates is attained in all these network settings but also network changing conditions such as mobility and dynamic channel capacity can be tracked in real time","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"13 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":"129556023","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}
N. Ota, Spencer Ahrens, Andrew Redfern, P. Wright, Xin Yang
{"title":"An Application-Driven Architecture for Residential Energy Management with Wireless Sensor Networks","authors":"N. Ota, Spencer Ahrens, Andrew Redfern, P. Wright, Xin Yang","doi":"10.1109/MOBHOC.2006.278626","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278626","url":null,"abstract":"This paper presents an application-driven multi-agent architecture to address the evolving use of wireless sensor networks as an enabling technology for autonomous residential energy management. Paradigm shifts in the electrical utility industry are changing the requirements for isolated residential devices. Dynamic electricity pricing rather than static flat rates requires increased automation and awareness to manage occupant comfort and price preferences. Automated load reduction programs, called demand response, require asynchronous control of electrical devices in response to signals from a utility provider. The architecture addresses key issues for a scalable, extensible system. A tiered design provides multiple levels of processing and communication performance and allows measurement, data synthesis, and control functionality to exist at various logical and physical locations. A Java environment embodies this architecture with multi-agent concepts to connect wireless sensor nodes, other environments, and the Internet. An implementation and deployment results show feasibility","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"7 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":"122284461","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}
J. Hammer, Imran Hassan, C. Julien, Sanem Kabadayi, William J. O'brien, Jason Trujillo
{"title":"Dynamic Decision Support in Direct-Access Sensor Networks; A Demonstration","authors":"J. Hammer, Imran Hassan, C. Julien, Sanem Kabadayi, William J. O'brien, Jason Trujillo","doi":"10.1109/MOBHOC.2006.278614","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278614","url":null,"abstract":"This paper describes application demonstrations of a new middleware that supports dynamic decision support over networks of resource-constrained devices. For the purposes of our demonstrations, we tap into intelligent job site applications for the construction domain. The demonstrations are carefully constructed to highlight our middleware's ability to provide on-demand access to local data, aggregation of data across dynamically defined regions, fusion of heterogeneous sensor data, and intelligent application-sensitive sensor clustering. The paper briefly describes the middleware and the details of the demonstrations","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"22 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":"127073332","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 Efficient Thermal Aware Routing Algorithms for Embedded Biomedical Sensor Networks","authors":"A. Bag, M. Bassiouni","doi":"10.1109/MOBHOC.2006.278619","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278619","url":null,"abstract":"One of the major applications of sensor networks in near future will be in the area of biomedical research. Implanted biosensor nodes are already being used for various medical applications. These in-vivo sensor networks collect different biometric data and communicate the data to the base station wirelessly. These sensor networks produce heat, as the nodes have to communicate among themselves wirelessly. The rise in temperature of the nodes due to communication should not be very high. A high temperature of the in-vivo nodes for a prolonged period might damage the surrounding tissues. In this paper, we propose a new routing algorithm that reduces the amount of heat produced in the network. In the simple form, the algorithm routes packets to the coolest neighbor without inducing routing loops. In the adaptive form, the algorithm uses mechanisms to adapt to topologies with low degree of connectivity and to switch to shortest path routing if a time threshold is exceeded. The proposed algorithm performs much better in terms of reducing the amount of heat produced, delay and power consumption compared to the shortest hop routing algorithm and a previously proposed thermal aware routing algorithm (TARA)","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"60 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120995894","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}
Guang Yang, Ling-Jyh Chen, Tony Sun, Biao Zhou, M. Gerla
{"title":"Ad-hoc Storage Overlay System (ASOS): A Delay-Tolerant Approach in MANETs","authors":"Guang Yang, Ling-Jyh Chen, Tony Sun, Biao Zhou, M. Gerla","doi":"10.1109/MOBHOC.2006.278568","DOIUrl":"https://doi.org/10.1109/MOBHOC.2006.278568","url":null,"abstract":"Mobile ad-hoc networks (MANETs) are most useful in unprepared emergencies where critical applications must be launched quickly. However, they often operate in an adverse environment where end-to-end connectivity is highly susceptible to disruption. Adjusting the motion of existing nodes or deploying additional nodes can improve the connectivity under some circumstances, but for scenarios where connectivity cannot be immediately improved, disruption must be coped with properly. In this paper we propose the ad-hoc storage overlay system (ASOS). ASOS is a self-organized overlay of storage-abundant nodes to jointly provide distributed and reliable storage to data flows under disruption. ASOS is a delay-tolerant networking (DTN) approach that significantly improves the applicability of MANETs in practice","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"45 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":"127005517","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}