Digital Communications and Networks最新文献

筛选
英文 中文
Joint Range and Load Considerations for Topology Control in Wireless Ad Hoc Networks 无线自组织网络拓扑控制的联合范围和负载考虑
Digital Communications and Networks Pub Date : 2006-01-01 DOI: 10.1109/SAHCN.2006.288503
S. Zarifzadeh, A. Nayyeri, N. Yazdani
{"title":"Joint Range and Load Considerations for Topology Control in Wireless Ad Hoc Networks","authors":"S. Zarifzadeh, A. Nayyeri, N. Yazdani","doi":"10.1109/SAHCN.2006.288503","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288503","url":null,"abstract":"Wireless ad hoc networks are usually composed of tiny and resource constraint devices, which make energy conservation a vital concern of their design. Reducing energy consumption has been addressed through different aspects till now. Topology control (TC) is a well-known approach which tries to assign the transmission ranges of nodes to optimize energy utilization while keeping some network properties like connectivity. However, in current TC schemes, the transmission range of each node is mostly accounted as the exclusive estimator for its energy consumption, while ignoring the amount of data it sends or relays. In this paper, we redefine the problem of topology control regarding both traffic load and transmission range parameters. After proving the NP-hardness of the new problem, we mathematically formulate it as a mixed integer linear programming problem to find the optimal solutions. Then, we introduce two polynomial-time heuristic algorithms to practically solve the problem. Finally, we show the advantages of our proposals through simulations","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"183 1","pages":"469-478"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74646077","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
Resilient JPv6 Multicast Address Allocation in Ad Hoc Networks Ad Hoc网络中弹性JPv6组播地址分配
Digital Communications and Networks Pub Date : 2006-01-01 DOI: 10.1109/SAHCN.2006.288561
J.K.O. Lindqvist, Antti Ylä-Jääski, J. Manner
{"title":"Resilient JPv6 Multicast Address Allocation in Ad Hoc Networks","authors":"J.K.O. Lindqvist, Antti Ylä-Jääski, J. Manner","doi":"10.1109/SAHCN.2006.288561","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288561","url":null,"abstract":"Multicast address allocation in the Internet has been the focus of much research and standardization. However, the multicast address allocation problem has been overlooked in ad hoc networking research. In this paper, we survey approaches to solving the multicast address allocation problem and analyze the security characteristics of the proposals. We show that using random assignment in IPv6 based ad hoc networks for multicast address allocation is more secure and bandwidth efficient than the previous proposals. We use passive listening to obtain network prefixes for autoconfiguring a global multicast address. The ideas presented in this paper are useful for practical deployment of ad hoc networks","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"43 1","pages":"786-791"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77597976","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}
引用次数: 0
Hybrid Wireless Networks: Applications, Architectures and New Perspectives 混合无线网络:应用、架构和新观点
Digital Communications and Networks Pub Date : 2006-01-01 DOI: 10.1109/SAHCN.2006.288571
Christian Tchepnda, H. Moustafa, H. Labiod
{"title":"Hybrid Wireless Networks: Applications, Architectures and New Perspectives","authors":"Christian Tchepnda, H. Moustafa, H. Labiod","doi":"10.1109/SAHCN.2006.288571","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288571","url":null,"abstract":"With the advent and ubiquitous of wireless technology, a wide range of advanced services are expected to be supported including appealing services that currently exist in wired systems. Nevertheless, the resource constraints in wireless environment may render difficulty to realizing all the desirable services. Consequently, an infrastructure with high data rate is necessary to complement the resource constraints and to act as anchor points linking mobile nodes to other fixed networks as the Internet. Hybrid wireless networks have emerged as a promising solution, allowing mobile clients to achieve higher performance and service access in a seamless manner independent of their existence in wireless LAN (WLAN) communication range. In this paper we address the benefits of hybrid wireless networks, showing their possible applications and presenting a classification for their emerging architectures. Also, we identify the research challenge arising from the problem of applying the grid computing concept in such hybrid wireless environment, showing the expected benefits from the aggregated fixed-mobile capacity. Finally, we propose our vision for a potential architectural model, which is expected to provide useful services by the network operator or the service provider in such a hybrid environment","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"54 1","pages":"848-853"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80056010","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}
引用次数: 15
Code Dissemination in Sensor Networks with MDeluge 基于MDeluge的传感器网络代码传播
Digital Communications and Networks Pub Date : 2006-01-01 DOI: 10.1109/SAHCN.2006.288527
Xia Zh, B. Sarikaya
{"title":"Code Dissemination in Sensor Networks with MDeluge","authors":"Xia Zh, B. Sarikaya","doi":"10.1109/SAHCN.2006.288527","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288527","url":null,"abstract":"In today's wireless sensor networks there is a need to improve macro programming of the sensor nodes so that sensor nodes can execute various applications in a flexible manner. There is a need to contribute to macro programming of wireless sensor networks by developing new code dissemination techniques which can disseminate the code into designated sensor nodes. We present a new algorithm called multicast deluge (MDeluge) which can be used to disseminate the code image into a designated subnet of a wireless sensor network. MDeluge disseminates code in the sensor network using a tree which is formed when the sensor nodes send code request messages. Micro server keeps the code and sends it based on the requests. MDeluge disseminates binary code as well as capsules of Mate. We extend MDeluge for the sensor networks that are geographically distributed and that have moving nodes. Assuming a grid structured wireless sensor network we present an analysis of various message costs as well as the overall cost of data messages of MDeluge. Simulation of MDeluge shows that MDeluge performs better than Deluge to disseminate the code into designated sensor nodes","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"38 1","pages":"661-666"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80845643","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}
引用次数: 7
Eavesdropping Minimization via Transmission Power Control in Ad-Hoc Wireless Networks 基于传输功率控制的Ad-Hoc无线网络窃听最小化
Digital Communications and Networks Pub Date : 2006-01-01 DOI: 10.1109/SAHCN.2006.288535
Jung-Chun Kao, R. Marculescu
{"title":"Eavesdropping Minimization via Transmission Power Control in Ad-Hoc Wireless Networks","authors":"Jung-Chun Kao, R. Marculescu","doi":"10.1109/SAHCN.2006.288535","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288535","url":null,"abstract":"Reconnaissance activity is the most frequent incident on computer networks since 2002. In fact, most attacks (including DoS attacks) are usually preceded by reconnaissance activity. In order to defend against reconnaissance activity in ad-hoc wireless networks, we propose to use transmission power control as an effective mean to minimize the eavesdropping risk. Our main contributions are as follows: first, we cast the w-th order eavesdropping risk as the maximum probability of packets being eavesdropped when there are w adversarial nodes in the network. Second, we derive the closed-form solution of the 1st order eavesdropping risk as a 3rd-order polynomial function of normalized transmission radius. This derivation is based on the recently proposed model by El Gamal which assumes a uniform distribution of user nodes. Then we generalize the model to allow arbitrary user nodes distribution and prove that the uniform user distribution actually minimizes the 1st order eavesdropping risk. This result plays an essential role in deriving the first analytical bounds for the eavesdropping risk given arbitrary user distribution. Our simulation results show that for a wide range of non-uniform traffic patterns, the eavesdropping risk has the same order of magnitude as the corresponding uniform traffic cases","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"10 1","pages":"707-714"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88204485","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}
引用次数: 42
Search-quality Tradeoffs for Routing in Non-ideal Wireless Networks 非理想无线网络中路由的搜索质量权衡
Digital Communications and Networks Pub Date : 2006-01-01 DOI: 10.1109/SAHCN.2006.288404
C. Buragohain, D. Agrawal, S. Suri
{"title":"Search-quality Tradeoffs for Routing in Non-ideal Wireless Networks","authors":"C. Buragohain, D. Agrawal, S. Suri","doi":"10.1109/SAHCN.2006.288404","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288404","url":null,"abstract":"Typical wireless routing protocols like AODV/DSR are not scalable to very large networks because they employ flooding for route discovery. Geographic routing protocols like GPSR are highly scalable because they require minimum control overhead, but depend on idealized link quality models (such as the unit disk model) which are not always applicable. We explore the routing spectrum between these two extremes under a realistic random link quality model. It is common wisdom that by adding limited flooding to a protocol like geographic routing improves quality. In this paper, we provide a formal and quantitative formulation of this trade-off, and show both analytically and experimentally that a significant improvement in path quality is possible by searching a narrow region around the geographic straight-line path between the source and destination. In particular, if the end-to-end throughput is measured as the product of link reliabilities in a path, then we demonstrate that the path quality improves exponentially as the search region is broadened","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"72 1","pages":"10-19"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86258036","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
Query Processing Optimization Through Sample Size and Monitoring Coverage Controlling in Wireless Sensor Networks 基于样本大小和监测覆盖控制的无线传感器网络查询处理优化
Digital Communications and Networks Pub Date : 2006-01-01 DOI: 10.1109/SAHCN.2006.288568
Qingchun Ren, Q. Liang
{"title":"Query Processing Optimization Through Sample Size and Monitoring Coverage Controlling in Wireless Sensor Networks","authors":"Qingchun Ren, Q. Liang","doi":"10.1109/SAHCN.2006.288568","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288568","url":null,"abstract":"Query processing has been studied extensively in traditional database systems. But few of existed methods can be directly applied to wireless sensor database systems due to their characteristics, such as decentralized nature, limited computational power, imperfect information recorded, and energy scarcity of individual sensor nodes. In this paper, we extend our previous work: quality-guaranteed and energy-efficient algorithm (QGEE) for wireless sensor database systems. We introduce radius of covering disk from point spread function (PSF) aspect and sample size for query quality and energy consumption control. PSF introduces ambiguity into query answers, since the sensitivity of nodes is nonuniform within monitoring region. Sample size determination refers to the process of determining exactly how many samples should be measured in order that the sampling distribution of estimators meets users' pre-specified target precision. In this paper, we formulate the criteria to determine the optimum radius and sample size according to users' requirements on query answers. Simulation results demonstrate that the impact of sample size and monitoring coverage on query answers in terms of root mean square error (RMSE)","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"15 1","pages":"830-834"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82742304","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
Low-complexity beamforming techniques for wireless multihop networks 无线多跳网络的低复杂度波束形成技术
Digital Communications and Networks Pub Date : 2006-01-01 DOI: 10.1109/SAHCN.2006.288505
R. Vilzmann, J. Widmer, I. Aad, C. Hartmann
{"title":"Low-complexity beamforming techniques for wireless multihop networks","authors":"R. Vilzmann, J. Widmer, I. Aad, C. Hartmann","doi":"10.1109/SAHCN.2006.288505","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288505","url":null,"abstract":"Protocols for beamforming antennas usually direct the beam toward the respective communication partner. This requires significant coordination between nodes and results in frequent changes of the beam direction. In this paper, we present much simpler algorithms that instead aim at improving connectivity and robustness of routing. A node computes the optimal beam direction using aggregate information about its neighborhood such as the number of neighbors in each beam direction. We analyze the performance of such algorithms in terms of number of paths to a destination, mutual interference, and route lifetime in mobile networks, and show that they are a promising alternative to existing beamforming schemes","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"37 1","pages":"489-497"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90253587","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
Coverage Aware Buffer Management and Scheduling for Wireless Sensor Networks 无线传感器网络覆盖感知缓冲管理与调度
Digital Communications and Networks Pub Date : 2006-01-01 DOI: 10.1109/SAHCN.2006.288414
Eugene Chai, M. Chan, A. Ananda
{"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}
引用次数: 9
A Biologically Inspired Architecture for Self-Managing Sensor Networks 自我管理传感器网络的生物学启发架构
Digital Communications and Networks Pub Date : 2006-01-01 DOI: 10.1109/SAHCN.2006.288553
P. Boonma, P. Champrasert, J. Suzuki
{"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}
引用次数: 9
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信