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

Link Cost and Reliability of Frame Preamble MAC Protocols 帧前MAC协议的链路开销和可靠性

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

A. Bachir, L. Samper, D. Barthel, M. Heusse, A. Duda

引用次数: 5

Cross-Layer Analysis of Error Control in Wireless Sensor Networks 无线传感器网络误差控制的跨层分析

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

M. Vuran, I. Akyildiz

{"title":"Cross-Layer Analysis of Error Control in Wireless Sensor Networks","authors":"M. Vuran, I. Akyildiz","doi":"10.1109/SAHCN.2006.288515","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288515","url":null,"abstract":"Severe energy constraints and hence the low power communication requirements amplify the significance of the energy efficient and preferably cross-layer error control mechanisms in wireless sensor networks (WSN). In this paper, a cross-layer methodology for the analysis of error control schemes in WSNs is presented such that the effects of multi-hop routing and the broadcast nature of the wireless channel are investigated. More specifically, the cross-layer effects of routing, medium access and physical layers are considered. This analysis enables a comprehensive comparison of forward error correction (FEC) and automatic repeat request (ARQ) in WSNs. FEC schemes improve the error resiliency compared to ARQ. In a multi-hop network, this improvement can be exploited by reducing the transmit power (transmit power control) or by constructing longer hops (hop length extension), which can be achieved through channel-aware routing protocols. The results of our analysis reveal that for certain FEC codes, the hop length extension decreases both the energy consumption and the end-to-end latency subject to a target PER compared to ARQ. Thus, FEC codes can be regarded as an important candidate for delay sensitive traffic in WSNs. On the other hand, transmit power control results in significant savings in energy consumption at the cost of increased latency. Moreover, the cases where ARQ outperforms FEC codes are indicated for various end-to-end distance and target PER values","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"62 1","pages":"585-594"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80558002","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}

引用次数: 83

Island Hopping: Efficient Mobility-Assisted Forwarding in Partitioned Networks 岛跳:分区网络中高效移动辅助转发

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

Natasa Sarafijanovic-Djukic, M. Piórkowski, M. Grossglauser

{"title":"Island Hopping: Efficient Mobility-Assisted Forwarding in Partitioned Networks","authors":"Natasa Sarafijanovic-Djukic, M. Piórkowski, M. Grossglauser","doi":"10.1109/SAHCN.2006.288427","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288427","url":null,"abstract":"Mobile wireless ad hoc and sensor networks can be permanently partitioned in many interesting scenarios. This implies that instantaneous end-to-end routes do not exist. Nevertheless, when nodes are mobile, it is possible to forward messages to their destinations through mobility. We observe that in many practical settings, spatial node distributions are very heterogeneous and possess concentration points of high node density. The locations of these concentration points and the flow of nodes between them tend to be stable over time. This motivates a novel mobility model, where nodes move randomly between stable islands of connectivity, where they are likely to encounter other nodes, while connectivity is very limited outside these islands. Our goal is to exploit such a stable topology of concentration points by developing algorithms that allow nodes to collaborate to discover this topology and to use it for efficient mobility forwarding. We achieve this without any external signals to nodes, such as geographic positions or fixed beacons; instead, we rely only on the evolution of the set of neighbors of each node. We propose an algorithm for this collaborative graph discovery problem and show that the inferred topology can greatly improve the efficiency of mobility forwarding. Using both synthetic and data-driven mobility models we show through simulations that our approach achieves end-to-end delays comparable to those of epidemic approaches, while requiring a significantly lower transmission overhead","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"59 1","pages":"226-235"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85023407","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}

引用次数: 149

Minimal Transmission Power vs. Signal Strength as Distance Estimation for Localization in Wireless Sensor Networks 最小传输功率与信号强度作为无线传感器网络定位的距离估计

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

J. Blumenthal, F. Reichenbach, D. Timmermann

引用次数: 52

On the Information Lifetime and the Localization Cost in Sensor Networks with Random Topologies 随机拓扑传感器网络的信息生存期和定位代价

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

C. Westphal

{"title":"On the Information Lifetime and the Localization Cost in Sensor Networks with Random Topologies","authors":"C. Westphal","doi":"10.1109/SAHCN.2006.288501","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288501","url":null,"abstract":"Sensor networks (and to some extent ad hoc networks) are networks of nodes with resource constraints, such as a limited battery life, a limited bandwidth or a limited processing capacity. These constraints create a well documented trade-off: each node needs to participate in the network to perform its role or duty, while this participation will deplete the node's resources. Here we consider a particular aspect of this trade-off: the storage of information in the network. Due to the resource constraints, each single node carries an incentive to limit the amount of data it contains. This leads to the expiration of the data carried by the node after a period of time. On the other hand, some data is critical to the functioning of the whole network, and should be found in the network at all times. In C. Westphal (2005), we introduced the trade-off between the finite lifetime of a piece of information at each node, and the survival of this information indefinitely within the network. We then studied this trade-off in a lattice topology and a tree topology. Here, we extend the results of C Westphal (2005) in two directions: we consider random topologies for the underlying network, and we take into account the cost of exchanging information in the network. We show that the maximum number of hops in a request for information broadcast is a critical parameter to ensure the survivability of any information within the network indefinitely. We identify the parameter which minimizes the load on the network for a network graph satisfying the Poisson boolean model. We also show how to minimize the cost of the dissemination on the network, so as to keep this cost decreasing asymptotically to 0","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"22 1","pages":"450-459"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81594950","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}

引用次数: 1

LLM:Low Latency MAC Protocol for Wireless Sensor Networks 无线传感器网络的低延迟MAC协议

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

Sumeet N. Parmar, Sukumar Nandi, A. Chowdhury

引用次数: 2

Multichannel MAC Protocols for Wireless Networks 无线网络的多通道MAC协议

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

R. Maheshwari, Himanshu Gupta, Samir R Das

引用次数: 181

Angle of Arrival Localization for Wireless Sensor Networks 无线传感器网络的到达角定位

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

Rong Peng, M. Sichitiu

引用次数: 705

Memento: A Health Monitoring System for Wireless Sensor Networks 纪念品:无线传感器网络的健康监测系统

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

S. Rost, H. Balakrishnan

引用次数: 180

RideSharing: Fault Tolerant Aggregation in Sensor Networks Using Corrective Actions 拼车:传感器网络中的纠错聚合

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

Sameh Gobriel, S. Khattab, D. Mossé, J. Brustoloni, R. Melhem

{"title":"RideSharing: Fault Tolerant Aggregation in Sensor Networks Using Corrective Actions","authors":"Sameh Gobriel, S. Khattab, D. Mossé, J. Brustoloni, R. Melhem","doi":"10.1109/SAHCN.2006.288516","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288516","url":null,"abstract":"In wireless sensor networks (WSNs), the users' objective is to extract useful global information by collecting individual sensor readings. Conventionally, this is done using in-network aggregation on a spanning tree from sensors to data sink. However, the spanning tree structure is not robust against communication errors; when a packet is lost, so is a complete subtree of values. Multipath routing can mask some of these errors, but on the other hand, may aggregate individual sensor values multiple times. This may produce erroneous results when dealing with duplicate-sensitive aggregates, such as SUM, COUNT, and AVERAGE. In this paper, we present and analyze two new fault tolerant schemes for duplicate-sensitive aggregation in WSNs: (1) cascaded ridesharing and (2) diffused ridesharing. These schemes use the available path redundancy in the WSN to deliver a correct aggregate result to the data sink. Compared to state-of-the-art, our schemes deliver results with lower root mean square (RMS) error and consume much less energy and bandwidth. RideSharing can consume as much as 50% less resources than hash-based schemes, such as SKETCHES and synopsis diffusion, while achieving lower RMS for reasonable link error rates","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"15 1","pages":"595-604"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90248184","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}

引用次数: 54