Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.最新文献_第9页

Deployable overlay network for defense against distributed SYN flood attacks 可部署覆盖网络，防御分布式SYN flood攻击

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1093/ietcom/e91-b.8.2618

Y. Ohsita, S. Ata, M. Murata

引用次数: 15

A novel IEEE 802.15.3 CTA sharing protocol for supporting VBR streams 一种支持VBR流的新型IEEE 802.15.3 CTA共享协议

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523821

Kwan-Wu Chin, D. Lowe

{"title":"A novel IEEE 802.15.3 CTA sharing protocol for supporting VBR streams","authors":"Kwan-Wu Chin, D. Lowe","doi":"10.1109/ICCCN.2005.1523821","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523821","url":null,"abstract":"The IEEE 802.15.3 MAC enables high-rate communications between devices in a wireless personal area network and has good support for applications requiring quality of service (QoS). To meet applications' QoS requirements, such as delay and jitter, the channel time allocation (CTA) scheduler plays an important role in sizing and positioning CTAs within each super-frame. In this paper, we first present a novel CTA sharing protocol, called VBR-MCTA that enables the sharing of CTAs belonging to streams with the same group identity. This allows our protocol to exploit the statistical characteristics of variable bit rate (VBR) streams by giving unused time units to a How that requires peak rate allocation. We then present two optimizations to VBR-MCTA, namely VBR-Blind and VBR-TokenBus. The former, by giving ownership of a CTA in a round-robin manner without consideration to traffic profiles, does not consume any valuable \"air-time\" with signaling overheads. The latter allows a CTA to be shared by multiple devices that take turns owning unused \"air-time\" from CTAs. We have simulated VBR-MCTA and its optimizations in the ns-2 simulator over an implementation of the IEEE 802.15.3 MAC. Our results show that VBR-TokenBus has the best delay and jitter as it provides a one to six milliseconds reduction in both compared to standard CTA methods. VSR-Blind, although having performing poorer than MCTA-Token or VBR-MCTA, is still significantly better than traditional CTA methods at a reduced overhead.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124297172","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}

引用次数: 10

Energy-aware connected dominating set construction in mobile ad hoc networks 移动自组网中能量感知连接支配集的构建

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523855

Bonam Kim, Junmo Yang, Dong Zhou, Min-Te Sun

引用次数: 21

STCP: a generic transport layer protocol for wireless sensor networks STCP:无线传感器网络的通用传输层协议

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523908

Yogesh G. Iyer, S. Gandham, S. Venkatesan

引用次数: 319

Low-energy sensor network time synchronization as an emergent property 低能量传感器网络的时间同步特性

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523817

S. Bush

引用次数: 21

Traffic engineering for virtual private networks and random traffic demands in WDM optical core networks 虚拟专用网的流量工程和WDM光核心网的随机流量需求

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523876

E. Doumith, M. Gagnaire, O. Audouin, N. Puech

引用次数: 3

A lightweight classification algorithm for energy conservation in wireless sensor networks 一种用于无线传感器网络节能的轻量级分类算法

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523816

N. Tezcan, Wenye Wang

{"title":"A lightweight classification algorithm for energy conservation in wireless sensor networks","authors":"N. Tezcan, Wenye Wang","doi":"10.1109/ICCCN.2005.1523816","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523816","url":null,"abstract":"Classification of sensor nodes can be used as a technique for conserving energy and prolonging the lifetime of a wireless sensor network (WSN). In this paper, we present a new algorithm of lightweight and dynamic classification. By this algorithm, energy consumption is reduced while providing a full coverage, which is an important network parameter in WSNs. Moreover, node classification is adaptive to topology changes and has no constraint on routing protocols and hardware. Based on sensors residual energy, they are classified as essential and non-essential and rotated dynamically. Essential nodes send their measurements to the sink, whereas, non-essential ones do not send new data and receive queries from the sink. This reduces transmitting and receiving energy of non-essential nodes and regulates data traffic. Further, our mechanism may provide location-based tunable redundancy, e.g., if redundant data is needed from a specific region, the sink may query the corresponding essential nodes to activate non-essential ones in that region. We analyze the complexity and energy consumption for the scenario where nodes are randomly deployed in a given region. Analysis, supported by extensive simulation in ns2, shows that energy consumption due to communications can be reduced in proportional to the ratio of essential nodes and fairly distributed among sensors by rotation.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133438552","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}

引用次数: 3

On-line multicast routing in WDM grooming networks WDM疏导网络中的在线组播路由

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523861

A. Vishwanath, W. Liang

引用次数: 5

Stability and hop-count based approach for route computation in MANET 基于稳定性和跳数的MANET路由计算方法

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523800

Sridhar K, M. Chan

{"title":"Stability and hop-count based approach for route computation in MANET","authors":"Sridhar K, M. Chan","doi":"10.1109/ICCCN.2005.1523800","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523800","url":null,"abstract":"In this paper, we present an approach for MANET routing based on stability and hop-count, where the stability metric considered is the residual lifetime of a link. We view stability based routing not as a separate routing protocol but as an enhancement to a hop-count based routing protocol (e.g. DSR or AODV), so that the expected residual lifetime as well as hop count of a route are taken into account. First, we investigate how residual link lifetime is affected by parameters such as speed and mobility pattern using simulation. The result shows that residual link lifetime is a function of current link age, mobility speed and mobility pattern and does not vary monotonically with age. Therefore, intuitive idea such as older links are more stable, which is used in existing stability-based routing algorithms like associativity based routing (ABR), does not hold across a large spectrum of mobility speeds and models. Instead, the reverse can be true. We propose stability and hop-count based routing algorithm (SHARC) using DSR as the basic routing protocol. The stability of a path is calculated using a simple histogram based estimator. Simulation results show that SHARC performs better than a hop-count only algorithm (DSR) and a stability only algorithm for both throughout of long-lived TCP and response time of short data transfer. SHARC also performs close to an algorithm with perfect knowledge of link residual lifetime in many cases.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116356279","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}

引用次数: 53

Reducing restoration blocking in WDM optical networks 减少WDM光网络中的恢复阻塞

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523877

Zhi Liu, L. Ruan

引用次数: 2