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

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

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

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

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

Security Services in Wireless Sensor Networks Using Sparse Random Coding 基于稀疏随机编码的无线传感器网络安全服务

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

F. Delgosha, Erman Ayday, K. Chan, F. Fekri

{"title":"Security Services in Wireless Sensor Networks Using Sparse Random Coding","authors":"F. Delgosha, Erman Ayday, K. Chan, F. Fekri","doi":"10.1109/SAHCN.2006.288407","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288407","url":null,"abstract":"The task of providing security services for wireless sensor networks is not trivial due to the resource constraints of the sensor nodes. An adversary may launch a wide range of attacks including eavesdropping, message forgery, packet dropping, and noise injection. In this paper, we propose random coding security (RCS) that provides protection against all the aforementioned attacks. For this purpose, the proposed protocol makes extensive use of node collaboration and data redundancy. Moreover, using location information, we both localize adversarial activities to the area under attack and enhance routing the data toward the sink. The objectives of using the novel idea of sparse random coding in RCS are twofold. First, every node generates correlated data by calculating random linear combinations of the received packets. Hence, the availability of the data at the receiver is guaranteed with a high probability. The second advantage is the feasibility of implementing the RCS in the real case scenario in which the communication media between the sensors is usually modeled as the erasure channel. The existing protocols cannot be trivially modified to suit this realistic situation. In the overall, RCS provides many security services with computation and communication overheads comparable with other schemes","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"57 1","pages":"40-49"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77037085","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

Clustering Ad Hoc Networks: Schemes and Classifications 聚类自组织网络:方案和分类

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

D. Wei, A. Chan

引用次数: 78

Optimal Worst-Case Coverage of Directional Field-of-View Sensor Networks 定向视场传感器网络的最优最坏情况覆盖

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

Jacob Adriaens, S. Megerian, M. Potkonjak

{"title":"Optimal Worst-Case Coverage of Directional Field-of-View Sensor Networks","authors":"Jacob Adriaens, S. Megerian, M. Potkonjak","doi":"10.1109/SAHCN.2006.288438","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288438","url":null,"abstract":"Sensor coverage is a fundamental sensor networking design and use issue that in general tries to answer the questions about the quality of sensing (surveillance) that a particular sensor network provides. Although isotropic sensor models and coverage formulations have been studied and analyzed in great depth recently, the obtained results do not easily extend to, and address the coverage of directional and field-of-view sensors such as imagers and video cameras. In this paper, we present an optimal polynomial time algorithm for computing the worst-case breach coverage in sensor networks that are comprised of directional \"field-of-view\" (FOV) sensors. Given a region covered by video cameras, a direct application of the presented algorithm is to compute \"breach\", which is defined as the maximal distance that any hostile target can maintain from the sensors while traversing through the region. Breach translates to \"worst-case coverage\" by assuming that in general, targets are more likely to be detected and observed when they are closer to the sensors (while in the field of view). The approach is amenable to the inclusion of any sensor detection model that is either independent of, or inversely proportional to distance from the targets. Although for the sake of discussion we mainly focus on square fields and model the sensor FOV as an isosceles triangle, we also discuss how the algorithm can trivially be extended to deal with arbitrary polygonal field boundaries and sensor FOVs, even in the presence of rigid obstacles. We also present several simulation-based studies of the scaling issues in such coverage problems and analyze the statistical properties of breach and its sensitivity to node density, locations, and orientations. A simple grid-based approximation approach is also analyzed for comparison and validation of the implementation","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"3 1","pages":"336-345"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74976411","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}

引用次数: 95