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

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

引用次数: 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

引用次数: 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

引用次数: 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

引用次数: 9

Distributed timing synchronization for sensor networks with coupled discrete-time oscillators 耦合离散时间振荡器传感器网络的分布式定时同步

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

M. Cremasehi, O. Simeone, U. Spagnolini

引用次数: 6

A Comprehensive Comparison of Routing Protocols for Large-Scale Wireless MANETs 大规模无线manet路由协议的综合比较

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

Ioannis Broustis, G. Jakllari, T. Repantis, M. Molle

{"title":"A Comprehensive Comparison of Routing Protocols for Large-Scale Wireless MANETs","authors":"Ioannis Broustis, G. Jakllari, T. Repantis, M. Molle","doi":"10.1109/SAHCN.2006.288588","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288588","url":null,"abstract":"Efficient routing protocols can provide significant benefits to mobile ad hoc networks, in terms of both performance and reliability. Many routing protocols for such networks have been proposed so far. Amongst the most popular ones are dynamic source routing (DSR), ad hoc on-demand distance vector (AODV), temporally-ordered routing algorithm (TORA) and location-aided routing (LAR). Despite the popularity of those protocols, research efforts have not focused in evaluating their performance when applied to large-scale wireless networks. Such networks are comprised of hundreds of nodes, connected via long routes. This greatly affects the network efficiency, since it necessitates frequent exchange of routing information. In this paper we present our observations regarding the behavior of the above protocols, in large-scale mobile ad hoc networks (MANETs). We consider wireless mobile terminals spread over a large geographical area, and we perform extensive simulations, using the QualNet and NS-2 simulators. The results of the simulations yield some interesting conclusions: AODV suffers in terms of packet delivery fraction (PDF) but scales very well in terms of end-to-end delay. DSR on the other hand scales well in terms of packet delivery fraction but suffers an important increase of end-to-end delay, as compared to its performance achieved in small-scale topologies. Also, the effect of maximum connections is severe on TORA, which seems unable to route large amounts of traffic. LAR, seems to scale very well, in terms of all metrics employed","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"43 24","pages":"951-956"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/SAHCN.2006.288588","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72366935","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}

引用次数: 63

A Distributed Min-Max Tree Algorithm for Maximum-Lifetime Multicast in Resource-limited Wireless Ad Hoc Networks 资源有限无线自组网中最大生存期组播的分布式最小-最大树算法

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

Song Guo, Victor C. M. Leung

引用次数: 0

A Proactive Data Bundling System for Intermittent Mobile Connections 间歇式移动连接的主动数据捆绑系统

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

Caitlin Holman, Khaled A. Harras, K. Almeroth, Anderson Lam

{"title":"A Proactive Data Bundling System for Intermittent Mobile Connections","authors":"Caitlin Holman, Khaled A. Harras, K. Almeroth, Anderson Lam","doi":"10.1109/SAHCN.2006.288426","DOIUrl":"https://doi.org/10.1109/SAHCN.2006.288426","url":null,"abstract":"As mobile and wireless technologies become more pervasive in our society, people begin to depend on network connectivity regardless of their location. Their mobility, however, implies a dynamic topology where routes to a destination cannot always be guaranteed. The intermittent connectivity, which results from this lack of end-to-end connection, is a dominant problem that leads to user frustration. Existing research to provide the mobile user with a mirage of constant connectivity generally presents mechanisms to handle disconnections when they occur. In contrast, the system we propose in this paper provides ways to handle disconnections before they occur. We present a data bundling system for intermittent connections (DBS-IC) comprised of a stationary agent (SA) and a mobile agent (MA). The SA proactively gathers data the user has previously specified, and opportunistically sends this data to the MA. The SA groups the user-requested data into one or more data bundles, which are then incrementally delivered to the MA during short periods of connectivity. We fully implement DBS-IC and evaluate its performance via live tests under varying network conditions. Results show that our system decreases data retrieval time by a factor of two in the average case and by a factor of 20 in the best case","PeriodicalId":58925,"journal":{"name":"Digital Communications and Networks","volume":"46 1","pages":"216-225"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85453992","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}

引用次数: 14