Digital Communications and Networks最新文献_第6页

Understanding the Gap between the IEEE 802.11 Protocol Performance and the Theoretical Limits 了解IEEE 802.11协议性能与理论极限之间的差距

Digital Communications and Networks Pub Date : 2006-01-01 DOI: 10.1109/SAHCN.2006.288497

M. Durvy, Patrick Thiran

引用次数: 17

Study on an Enhanced Link-Stability based Routing Scheme for Mobile Ad hoc Networks 一种基于增强链路稳定性的移动自组网路由方案研究

Digital Communications and Networks Pub Date : 2006-01-01 DOI: 10.1109/SAHCN.2006.288563

Wen-Fong Wang, Po-Hun Shih

{"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}

引用次数: 8

Effective Dissemination of Presence Information in Highly Partitioned Mobile Ad Hoc Networks 高分区移动自组网中存在信息的有效传播

Digital Communications and Networks Pub Date : 2006-01-01 DOI: 10.1109/SAHCN.2006.288428

C. Lindemann, O. P. Waldhorst

{"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}

引用次数: 8

Energy Efficient Transmission Scheme for Data-Gathering in Mobile Sensor Networks 移动传感器网络中数据采集的节能传输方案

Digital Communications and Networks Pub Date : 2006-01-01 DOI: 10.1109/SAHCN.2006.288506

Chao Wang, P. Ramanathan

{"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}

引用次数: 6

A Practical Approach to Landmark Deployment for Indoor Localization 一种实用的室内定位地标部署方法

Digital Communications and Networks Pub Date : 2006-01-01 DOI: 10.1109/SAHCN.2006.288441

Yingying Chen, J. Francisco, W. Trappe, R. Martin

引用次数: 209

Efficient Data Compression in Wireless Sensor Networks for Civil Infrastructure Health Monitoring 民用基础设施健康监测无线传感器网络的高效数据压缩

Digital Communications and Networks Pub Date : 2006-01-01 DOI: 10.1109/SAHCN.2006.288567

Shengpu Liu, Liang Cheng

引用次数: 23

Robot-Assisted Localization Techniques for Wireless Image Sensor Networks 无线图像传感器网络中的机器人辅助定位技术

Digital Communications and Networks Pub Date : 2006-01-01 DOI: 10.1109/SAHCN.2006.288443

Huang Lee, Hattie Dong, H. Aghajan

{"title":"Robot-Assisted Localization Techniques for Wireless Image Sensor Networks","authors":"Huang Lee, Hattie Dong, H. Aghajan","doi":"10.1109/SAHCN.2006.288443","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288443","url":null,"abstract":"We present a vision-based solution to the problem of topology discovery and localization of wireless sensor networks. In the proposed model, a robot controlled by the network is introduced to assist with localization of a network of image sensors, which are assumed to have image planes parallel to the agent's motion plane. The localization algorithm for the scenario where the moving agent has knowledge of its global coordinates is first studied. This baseline scenario is then used to build more complex localization algorithms in which the robot has no knowledge of its global positions. Two cases where the sensors have overlapping and non-overlapping fields of view (FOVs) are investigated. In order to implement the discovery algorithms for these two different cases, a forest structure is introduced to represent the topology of the network. We consider the collection of sensors with overlapping FOVs as a tree in the forest. The robot searches for nodes in each tree through boundary patrolling, while it searches for other trees by a radial pattern motion. Numerical analyses are provided to verify the proposed algorithms. Finally, experiment results show that the sensor coordinates estimated by the proposed algorithms accurately reflect the results found by manual methods","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"1 1","pages":"383-392"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88343229","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}

引用次数: 22

A Realistic Power Consumption Model for Wireless Sensor Network Devices 一个现实的无线传感器网络设备功耗模型

Digital Communications and Networks Pub Date : 2006-01-01 DOI: 10.1109/SAHCN.2006.288433

Qin Wang, Mark Hempstead, Woodward Yang

{"title":"A Realistic Power Consumption Model for Wireless Sensor Network Devices","authors":"Qin Wang, Mark Hempstead, Woodward Yang","doi":"10.1109/SAHCN.2006.288433","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288433","url":null,"abstract":"A realistic power consumption model of wireless communication subsystems typically used in many sensor network node devices is presented. Simple power consumption models for major components are individually identified, and the effective transmission range of a sensor node is modeled by the output power of the transmitting power amplifier, sensitivity of the receiving low noise amplifier, and RF environment. Using this basic model, conditions for minimum sensor network power consumption are derived for communication of sensor data from a source device to a destination node. Power consumption model parameters are extracted for two types of wireless sensor nodes that are widely used and commercially available. For typical hardware configurations and RF environments, it is shown that whenever single hop routing is possible it is almost always more power efficient than multi-hop routing. Further consideration of communication protocol overhead also shows that single hop routing will be more power efficient compared to multi-hop routing under realistic circumstances. This power consumption model can be used to guide design choices at many different layers of the design space including, topology design, node placement, energy efficient routing schemes, power management and the hardware design of future wireless sensor network devices","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"8 1","pages":"286-295"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87673998","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}

引用次数: 511

A Statistical Model for the Evaluation of the Distribution of the Received Power in Ad Hoc and Wireless Sensor Networks Ad Hoc和无线传感器网络中接收功率分布评估的统计模型

Digital Communications and Networks Pub Date : 2006-01-01 DOI: 10.1109/SAHCN.2006.288557

Enrica Salbaroli, A. Zanella

引用次数: 12

LEARN: localized energy aware restricted neighborhood routing for ad hoc networks 学习:局部能量感知限制邻居路由自组织网络

Digital Communications and Networks Pub Date : 2006-01-01 DOI: 10.1109/SAHCN.2006.288507

Yang Wang, Wenzhan Song, Weizhao Wang, Xiangyang Li, T. Dahlberg

{"title":"LEARN: localized energy aware restricted neighborhood routing for ad hoc networks","authors":"Yang Wang, Wenzhan Song, Weizhao Wang, Xiangyang Li, T. Dahlberg","doi":"10.1109/SAHCN.2006.288507","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288507","url":null,"abstract":"In this paper, we address the problem of energy efficient localized routing in wireless ad hoc networks. Numerous energy aware routing protocols were proposed to seek the power efficiency of routes. Among them, several geographical localized routing protocols were proposed to help making smarter routing decision using only local information and reduce the routing overhead. However, most of the proposed localized routing methods cannot theoretically guarantee the power efficiency of their routes. In this paper, we give the first localized routing algorithm, called localized energy aware restricted neighborhood routing (LEARN), which can guarantee the power efficiency of its route asymptotically almost sure. Given destination node t, an intermediate node v will only select a certain neighbor v such that < vut les alpha for a parameter alpha < pi/3 in our LEARN method. We theoretically prove that for a network, formed by nodes that are produced by a Poisson distribution with rate n over a compact and convex region O with unit area, when the transmission range rn = radicbetalnl/pin for some beta > pi/alpha, our LEARN routing protocol will find the route for any pair of nodes asymptotically almost sure. When the transmission range rn = radicbetalnl/pin for some beta < pi/alpha, the LEARN routing protocol will not be able to find the route for any pair of nodes asymptotically almost sure. We also conducted simulations to study the performance of LEARN and compare it with a typical localized routing protocol (GPSR) and a global ad hoc routing protocol (DSR)","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"70 1","pages":"508-517"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85048775","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}

引用次数: 43