{"title":"A Biologically Inspired Architecture for Self-Managing Sensor Networks","authors":"P. Boonma, P. Champrasert, J. Suzuki","doi":"10.1109/SAHCN.2006.288553","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288553","url":null,"abstract":"This paper describes a sensor network architecture, called BiSNET, which addresses several key issues in wireless sensor networks such as autonomy, adaptability and self-healing. Based on the observation that various biological systems have developed mechanisms necessary to overcome these issues, BiSNET follows certain biological principles such as decentralization, food gathering/storage and natural selection to design sensor networks. This paper describes and evaluates the biologically-inspired mechanisms in BiSNET. Preliminary simulation results show that BiSNET allows sensor nodes to autonomously adapt their duty cycles for power efficiency and responsiveness of data transmission and to collectively self-heal (i.e., detect and eliminate) false positives in their sensor readings","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"23 1","pages":"734-739"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90354104","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":"Distributed timing synchronization for sensor networks with coupled discrete-time oscillators","authors":"M. Cremasehi, O. Simeone, U. Spagnolini","doi":"10.1109/SAHCN.2006.288532","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288532","url":null,"abstract":"Physical layer-based distributed timing synchronization among nodes of a wireless network is currently being investigated in the literature as an interesting alternative to packet synchronization. In this paper, we analyze the convergence properties of such a system through algebraic graph theory, by modelling the nodes as discrete-time oscillators and taking into account the specific features of wireless channels (e.g., reciprocity, fading). The analysis is corroborated by numerical results and by comparison with the performance of a practical implementation of the distributed synchronization algorithm over a bandlimited noisy channel","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"247 1","pages":"690-694"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76979114","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}
Ioannis Broustis, G. Jakllari, T. Repantis, M. Molle
{"title":"A Comprehensive Comparison of Routing Protocols for Large-Scale Wireless MANETs","authors":"Ioannis Broustis, G. Jakllari, T. Repantis, M. Molle","doi":"10.1109/SAHCN.2006.288588","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288588","url":null,"abstract":"Efficient routing protocols can provide significant benefits to mobile ad hoc networks, in terms of both performance and reliability. Many routing protocols for such networks have been proposed so far. Amongst the most popular ones are dynamic source routing (DSR), ad hoc on-demand distance vector (AODV), temporally-ordered routing algorithm (TORA) and location-aided routing (LAR). Despite the popularity of those protocols, research efforts have not focused in evaluating their performance when applied to large-scale wireless networks. Such networks are comprised of hundreds of nodes, connected via long routes. This greatly affects the network efficiency, since it necessitates frequent exchange of routing information. In this paper we present our observations regarding the behavior of the above protocols, in large-scale mobile ad hoc networks (MANETs). We consider wireless mobile terminals spread over a large geographical area, and we perform extensive simulations, using the QualNet and NS-2 simulators. The results of the simulations yield some interesting conclusions: AODV suffers in terms of packet delivery fraction (PDF) but scales very well in terms of end-to-end delay. DSR on the other hand scales well in terms of packet delivery fraction but suffers an important increase of end-to-end delay, as compared to its performance achieved in small-scale topologies. Also, the effect of maximum connections is severe on TORA, which seems unable to route large amounts of traffic. LAR, seems to scale very well, in terms of all metrics employed","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"43 24","pages":"951-956"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/SAHCN.2006.288588","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72366935","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 Distributed Min-Max Tree Algorithm for Maximum-Lifetime Multicast in Resource-limited Wireless Ad Hoc Networks","authors":"Song Guo, Victor C. M. Leung","doi":"10.1109/SAHCN.2006.288529","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288529","url":null,"abstract":"We consider the problem of maximizing the multicast lifetime in multihop wireless networks in which each node is static and has limited energy, bandwidth, memory, and computation capabilities. Unlike most multicast algorithms that use centralized greedy algorithms, our algorithm can construct a global optimal maximum lifetime multicast tree in a distributed manner. It has a low complexity of O(lambdau ) for both memory and computation requirements at each node u, where lambdau is the degree of node u. The simulation results have shown that it has an expected linear communication complexity under different network sizes and multicast group sizes. This means that our distributed algorithm is also scalable in terms of communication overhead and it is very useful for large-scale energy and bandwidth constrained multihop wireless networks like sensor networks","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"150 1","pages":"673-677"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84922565","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}
Caitlin Holman, Khaled A. Harras, K. Almeroth, Anderson Lam
{"title":"A Proactive Data Bundling System for Intermittent Mobile Connections","authors":"Caitlin Holman, Khaled A. Harras, K. Almeroth, Anderson Lam","doi":"10.1109/SAHCN.2006.288426","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288426","url":null,"abstract":"As mobile and wireless technologies become more pervasive in our society, people begin to depend on network connectivity regardless of their location. Their mobility, however, implies a dynamic topology where routes to a destination cannot always be guaranteed. The intermittent connectivity, which results from this lack of end-to-end connection, is a dominant problem that leads to user frustration. Existing research to provide the mobile user with a mirage of constant connectivity generally presents mechanisms to handle disconnections when they occur. In contrast, the system we propose in this paper provides ways to handle disconnections before they occur. We present a data bundling system for intermittent connections (DBS-IC) comprised of a stationary agent (SA) and a mobile agent (MA). The SA proactively gathers data the user has previously specified, and opportunistically sends this data to the MA. The SA groups the user-requested data into one or more data bundles, which are then incrementally delivered to the MA during short periods of connectivity. We fully implement DBS-IC and evaluate its performance via live tests under varying network conditions. Results show that our system decreases data retrieval time by a factor of two in the average case and by a factor of 20 in the best case","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"46 1","pages":"216-225"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85453992","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":"Understanding the Gap between the IEEE 802.11 Protocol Performance and the Theoretical Limits","authors":"M. Durvy, Patrick Thiran","doi":"10.1109/SAHCN.2006.288497","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288497","url":null,"abstract":"The ability of the IEEE 802.11 medium access control (MAC) protocol to perform well in multi-hop ad hoc networks has been recently questioned. We observe levels of spatial reuse that are 30% to 50% away from the theoretical limit. The goal of this paper is to answer the following question: what prevents the IEEE 802.11 MAC protocol from operating at the limit determined by its physical layer? We identify three problems in the contention resolution mechanism of the IEEE 802.11 MAC protocol, and we show that they account for most of the gap separating the actual and optimal performances of the protocol. For each of the problems, we propose a solution that, once implemented, allows us to quantify the impact of the problem on the performance of the IEEE 802.11 MAC protocol. The resulting protocol operates 10% to 15% away from the theoretical limit. Finally, we show that reducing the overhead of the protocol to some negligible quantity brings the spatial reuse of the protocol to the theoretical limits. It also makes apparent the powerful organizing capacity of the IEEE 802.11 MAC protocol","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"32 1","pages":"412-420"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82058391","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":"Study on an Enhanced Link-Stability based Routing Scheme for Mobile Ad hoc Networks","authors":"Wen-Fong Wang, Po-Hun Shih","doi":"10.1109/SAHCN.2006.288563","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288563","url":null,"abstract":"In a mobile ad hoc network, each node can move arbitrarily such that its network topology may change frequently. This mobility factor may incur link failure during data packet transmission. The SSA routing protocol can get longer lived routes for ad hoc networks by using a route selection criteria based on signal strength and location stability. It indeed reduces route reconstruction that is caused by the link failure, and thus increases network throughput and decreases overhead. However, SSA is only suitable to the condition of high node density and low mobility, which is the most stable situation for ad hoc networks, due to the route selection strategy in its control algorithm. To compensate SSA for its weakness in the condition of high node density and high mobility and the condition of low node density and low mobility, we proposed an enhanced scheme named as SSA+. In this paper, we will describe the mechanisms of SSA+ and conduct several simulation experiments to verify and evaluate the performance of our scheme with respect to SSA. Simulation results show that SSA+ can effectively reduce the route reconstructions needed in all conditions","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"67 1","pages":"797-802"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83710225","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":"Effective Dissemination of Presence Information in Highly Partitioned Mobile Ad Hoc Networks","authors":"C. Lindemann, O. P. Waldhorst","doi":"10.1109/SAHCN.2006.288428","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288428","url":null,"abstract":"Presence technology enables users of an instant messaging (IM) system to determine if their contacts are online and ready to communicate. In this paper, we propose an effective approach for the proactive dissemination of frequently changing presence information in highly partitioned mobile, wireless networks with IEEE 802.11 technology. Although communication techniques for intermittently connected networks have been extensively studied in the field of delay tolerant networking, the fact that presence information is highly delay sensitive requires a thorough revision of these techniques. To this end, we use discrete-event simulation based on a high-level stochastic model of the IM system to compare different approaches for disseminating presence information in terms of sustained consistency (i.e., fraction of time presence information is in a coherent state) and traffic requirements. Building upon the outcome of the simulation study, we propose the system for presence information exchange by epidemic dissemination (SPEED). Results of a detailed ns-2 simulation study show that SPEED outperforms an approach based on optimized flooding by up to 20% in terms of sustained consistency for low node density and saves up to 48% of control traffic for medium to high node density","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"32 1","pages":"236-245"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82613404","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 Transmission Scheme for Data-Gathering in Mobile Sensor Networks","authors":"Chao Wang, P. Ramanathan","doi":"10.1109/SAHCN.2006.288506","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288506","url":null,"abstract":"Mobile sensor networks are being envisioned for certain applications like habitat monitoring and environmental sensing. For instance, mobile sensor nodes are attached to selected animals to gather data about their behavior. These data are uploaded to stationary units for detailed analysis over wireless ad-hoc networks. Since the mobile sensor nodes are likely to operate on batteries, reducing energy consumption for such data gathering is an important issue. This paper proposes a transmission scheme for power-adjustable radio to optimize transmit energy efficiency subject to given overflow and delay constraints. The energy efficiency is defined as the expected transmit energy to deliver one unit of data from sensor node to stationary unit. An analytical model is developed to estimate the unit energy, data throughput and delay for a sensor node in the single-hop case. Simulation results show that the model achieves very good accuracy. The proposed transmission scheme is then adapted to the multi-hop scenario. Simulations based on radio parameters from a sensor board demonstrate that high energy efficiency can be achieved by the transmission scheme in both single-hop and multi-hop cases","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"2014 1","pages":"498-507"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86551267","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 Practical Approach to Landmark Deployment for Indoor Localization","authors":"Yingying Chen, J. Francisco, W. Trappe, R. Martin","doi":"10.1109/SAHCN.2006.288441","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288441","url":null,"abstract":"We investigate the impact of landmark placement on localization performance using a combination of analytic and experimental analysis. For our analysis, we have derived an upper bound for the localization error of the linear least squares algorithm. This bound reflects the placement of landmarks as well as measurement errors at the landmarks. We next develop a novel algorithm, maxL minE, that using our analysis, finds a pattern for landmark placement that minimizes the maximum localization error. To show our results are applicable to a variety of localization algorithms, we then conducted a series of localization experiments using both an 802.11 (WiFi) network as well as an 802.15.4 (ZigBee) network in a real building environment. We use both received signal strength (RSS) and time-of-arrival (ToA) as ranging modalities. Our experimental results show that our landmark placement algorithm is generic because the resulting placements improve localization performance across a diverse set of algorithms, networks, and ranging modalities","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"1 1","pages":"365-373"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79173633","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}