Pub Date : 2006-01-01DOI: 10.1109/SAHCN.2006.288414
Eugene Chai, M. Chan, A. Ananda
Environmental monitoring and surveillance is a popular application of wireless sensor network. In such an application, the data transmitted are tagged with geographic information. A network with better coverage provides better quality-of-service since it will be able to monitor its area of responsibility more effectively. In this work, we study the impact of congestion on coverage of the sensor network. Congestion can negatively impact the performance since it can result in reduced coverage and power wastage. In this paper, we present a buffer management scheme called most redundant drop (MRD) and a scheduling algorithm called coverage transmit (CT) that make use of spatial information in sensor data to improve network coverage. Compared to drop-tail and FIFO, MRD and CT improve coverage by up to 75% when exact sensor location is available. Furthermore, as exact locations may not be available in practice, MRD and CT are evaluated using a modified DV-hop scheme that provides approximate localization. Simulation results show that substantial improvement can also be obtained using only approximated locations
{"title":"Coverage Aware Buffer Management and Scheduling for Wireless Sensor Networks","authors":"Eugene Chai, M. Chan, A. Ananda","doi":"10.1109/SAHCN.2006.288414","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288414","url":null,"abstract":"Environmental monitoring and surveillance is a popular application of wireless sensor network. In such an application, the data transmitted are tagged with geographic information. A network with better coverage provides better quality-of-service since it will be able to monitor its area of responsibility more effectively. In this work, we study the impact of congestion on coverage of the sensor network. Congestion can negatively impact the performance since it can result in reduced coverage and power wastage. In this paper, we present a buffer management scheme called most redundant drop (MRD) and a scheduling algorithm called coverage transmit (CT) that make use of spatial information in sensor data to improve network coverage. Compared to drop-tail and FIFO, MRD and CT improve coverage by up to 75% when exact sensor location is available. Furthermore, as exact locations may not be available in practice, MRD and CT are evaluated using a modified DV-hop scheme that provides approximate localization. Simulation results show that substantial improvement can also be obtained using only approximated locations","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"30 1","pages":"100-108"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80550872","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}
Pub Date : 2006-01-01DOI: 10.1109/SAHCN.2006.288553
P. Boonma, P. Champrasert, J. Suzuki
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
{"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}
Pub Date : 2006-01-01DOI: 10.1109/SAHCN.2006.288532
M. Cremasehi, O. Simeone, U. Spagnolini
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
{"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}
Pub Date : 2006-01-01DOI: 10.1109/SAHCN.2006.288588
Ioannis Broustis, G. Jakllari, T. Repantis, M. Molle
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
高效的路由协议可以在性能和可靠性方面为移动自组织网络提供显著的好处。目前已有许多针对此类网络的路由协议被提出。其中最流行的是动态源路由(DSR)， ad hoc按需距离矢量(AODV)，临时有序路由算法(TORA)和位置辅助路由(LAR)。尽管这些协议很受欢迎，但研究工作并没有集中在评估它们应用于大规模无线网络时的性能。这样的网络由数百个节点组成，通过长路线连接。这极大地影响了网络的效率，因为它需要频繁地交换路由信息。在本文中，我们提出了我们对上述协议在大规模移动自组织网络(manet)中的行为的观察。我们考虑无线移动终端分布在很大的地理区域，我们使用QualNet和NS-2模拟器进行了广泛的模拟。模拟的结果产生了一些有趣的结论:AODV在分组传递分数(PDF)方面受到影响，但在端到端延迟方面伸缩性很好。另一方面，DSR在分组传输分数方面扩展得很好，但与在小规模拓扑中实现的性能相比，端到端延迟有很大的增加。此外，最大连接对TORA的影响也很严重，它似乎无法路由大量的流量。从所采用的所有参数来看，LAR的可扩展性似乎非常好
{"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}
Pub Date : 2006-01-01DOI: 10.1109/SAHCN.2006.288529
Song Guo, Victor C. M. Leung
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
{"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}
Pub Date : 2006-01-01DOI: 10.1109/SAHCN.2006.288426
Caitlin Holman, Khaled A. Harras, K. Almeroth, Anderson Lam
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
{"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}
Pub Date : 2006-01-01DOI: 10.1109/SAHCN.2006.288497
M. Durvy, Patrick Thiran
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
{"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}
Pub Date : 2006-01-01DOI: 10.1109/SAHCN.2006.288563
Wen-Fong Wang, Po-Hun Shih
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
{"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}
Pub Date : 2006-01-01DOI: 10.1109/SAHCN.2006.288428
C. Lindemann, O. P. Waldhorst
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
{"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}
Pub Date : 2006-01-01DOI: 10.1109/SAHCN.2006.288506
Chao Wang, P. Ramanathan
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
{"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：