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

Mobility Metrics for Adaptive Routing 自适应路由的移动性度量

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

L. Qin, T. Kunz

引用次数: 3

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

Sensor Networks with Decentralized Binary Detection: Clustering and Lifetime 具有去中心化二值检测的传感器网络:聚类和寿命

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

G. Ferrari, M. Martalò

引用次数: 0

Topology Discovering Mechanism for Power Saving in Ad-hoc Wireless Networks 自组织无线网络节能的拓扑发现机制

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

A. Zabian

引用次数: 2

Topology Control to Simultaneously Achieve Near-Optimal Node Degree and Low Path Stretch in Ad hoc Networks 在Ad hoc网络中同时实现近最优节点度和低路径拉伸的拓扑控制

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

Ece Gelal, G. Jakllari, S. Krishnamurthy, N. Young

{"title":"Topology Control to Simultaneously Achieve Near-Optimal Node Degree and Low Path Stretch in Ad hoc Networks","authors":"Ece Gelal, G. Jakllari, S. Krishnamurthy, N. Young","doi":"10.1109/SAHCN.2006.288499","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288499","url":null,"abstract":"Our objective in this paper is to design topology control algorithms such that (i) nodes have low degree and (ii) paths in the network have few hops. Low node degree is desirable in networks equipped with smart antennas and to reduce access contention. Short paths are desirable for minimizing communication delays and for better robustness to channel impairments and to mobility. Given any arbitrary unit-disc graph G representing all feasible links, our algorithms find a sparse subgraph G' having a maximum node degree of six and, for each pair of vertices u, v, having hopsG'(u, v) = O(hopsG(u,v) + logDelta), where Delta is the maximum node degree in G and hops G(u, v) denotes the shortest path length from u to v in G. This result is near-optimal: (i) there is a connected UDG G in which no connected subgraph has degree less than five, and (ii) for any graph G, any bounded-degree subgraph G' must have hopsG'(u, v) = Omega(hopsG(u, v) + logDelta) for some u, v. Our distributed algorithm scales, preserves link symmetry, does not need node synchronization, and requires only O(n) messages. We perform extensive simulations that quantify the performance of our algorithm in realistic scenarios","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"30 1","pages":"431-439"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82811246","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}

引用次数: 11

Dynamic Hybrid Multi Routing Protocol For Ad Hoc Wireless Network Ad Hoc无线网络的动态混合多路由协议

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

Chaorong Peng, Chang Wen Chen

引用次数: 5

Bandwidth Consumption for Providing Fair Internet Access in Wireless Mesh Networks 在无线网状网络中提供公平互联网接入的带宽消耗

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

T. Scherer, T. Engel

引用次数: 6

Progressive Network Coding for Message-Forwarding in Ad-Hoc Wireless Networks Ad-Hoc无线网络中消息转发的渐进式网络编码

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

Xingkai Bao, Jing Li

引用次数: 11

MERIT: MEsh of RF sensors for Indoor Tracking 优点:用于室内跟踪的射频传感器网格

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

Yui-Wah Lee, E. P. Stuntebeck, Scott C. Miller

{"title":"MERIT: MEsh of RF sensors for Indoor Tracking","authors":"Yui-Wah Lee, E. P. Stuntebeck, Scott C. Miller","doi":"10.1109/SAHCN.2006.288511","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288511","url":null,"abstract":"A traditional approach to indoor tracking utilizes non-RF ranging techniques, such as infrared or ultrasound. The problem with these non-RF ranging techniques is that they do not work well when the tracking devices are buried in users' wallets or bags. As a result, there has been considerable interest in using only RF techniques for indoor tracking. Existing RF-only techniques, however, typically require a costly site survey and a floor-plan. In this paper, we present the MERIT system that we designed, implemented, and evaluated. MERIT is significantly different from existing systems in that it is pure RF-based yet it does not require a site survey nor a floor-plan. MERIT tracks users to a room granularity, and it can disambiguate neighboring rooms. This disambiguation is challenging because RF signals can traverse through walls. Also, because of indoor multipath interference, it is difficult to correlate signal strength with distance. In this work, we proposed two techniques for accurate disambiguation: spatial diversity and RF reflector. In our evaluation MERIT achieved an accuracy of 98.9%. MERIT was first conceived for a telecommunication application - intelligent telephone call routing, but it can also be used for other location-aware services","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"14 1","pages":"545-554"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82203893","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}

引用次数: 18

Circular-Layer Algorithm for Ad Hoc Sensor Networks to Balance Power Consumption 基于循环层算法的Ad Hoc传感器网络功耗平衡

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

D. Wei, A. Chan, Kevin V. N. Kameri

{"title":"Circular-Layer Algorithm for Ad Hoc Sensor Networks to Balance Power Consumption","authors":"D. Wei, A. Chan, Kevin V. N. Kameri","doi":"10.1109/SAHCN.2006.288587","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288587","url":null,"abstract":"In senor networks, the data traffic from the sensors are directional towards a data sink and are therefore uneven. The areas nearer the data sink experience higher data traffic and will run out of energy sooner. Circular-layer geometry takes into account the radial data traffic towards the data sink. We may construct an algorithm to divide the network into equal-area circular-layers, which are analogous to the square design in geographical adaptive fidelity (GAF). However, the circular-layer geometry alone has not taken into account the uneven data traffic. This paper proposes a circular-layer algorithm that schedules the sensors into active and sleep states in such a way as to evenly distribute the power consumption throughout the sensor networks. We divide the network into circular layers with the data sink at the center. The algorithm equalizes the lifetime time of all layers so that the nodes near the data sink will not run out of energy sooner. Energy is also wasted in reactive routing where the sensors flood the network with omni-directional route discovery messages to find a suitable route towards the data sink. This algorithm reduces such flooding by directing the route request messages towards the data sink, resulting in more energy saving. The circular-layer geometry alone is serving to save energy. In addition, balancing the power consumption throughout the network yields an additional lifetime extension of 21% in our simulation results of a four-layer scenario","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"65 1","pages":"945-950"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77801300","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