2008 IEEE International Conference on Network Protocols最新文献

Routing in intermittently connected sensor networks 间歇连接传感器网络中的路由

2008 IEEE International Conference on Network Protocols Pub Date : 2008-12-08 DOI: 10.1109/ICNP.2008.4697046

Lu Su, Changlei Liu, Hui Song, G. Cao

{"title":"Routing in intermittently connected sensor networks","authors":"Lu Su, Changlei Liu, Hui Song, G. Cao","doi":"10.1109/ICNP.2008.4697046","DOIUrl":"https://doi.org/10.1109/ICNP.2008.4697046","url":null,"abstract":"To prolong the lifetime of sensor networks, various scheduling schemes have been designed to reduce the number of active sensors. However, some scheduling strategies, such as partial coverage scheduling and target coverage scheduling, may result in disconnected network topologies, due to the low density of the active nodes. In such cases, traditional routing algorithms cannot be applied, and the shortest path discovered by these algorithms may not have the minimum packet delivery latency. In this paper, we address the problem of finding minimum latency routes in intermittently connected sensor networks by proposing an on-demand minimum latency (ODML) routing algorithm. Since on-demand routing algorithm does not work well when the source and destination frequently communicate with each other, we propose two proactive minimum latency routing algorithms: optimal-PML and quick-PML. Theoretical analysis and simulation results show that (1) ODML can effectively identify minimum latency routes which have much smaller latency than the shortest path, and (2) optimal-PML can minimize the routing message overhead and quick-PML can significantly reduce the route acquisition delay.","PeriodicalId":301984,"journal":{"name":"2008 IEEE International Conference on Network Protocols","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127413415","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}

引用次数: 50

Component based localization in sparse wireless ad hoc and sensor networks 稀疏无线自组网和传感器网络中基于组件的定位

2008 IEEE International Conference on Network Protocols Pub Date : 2008-12-08 DOI: 10.1109/ICNP.2008.4697047

Xiaoping Wang, Jun Luo, Shanshan Li, Dezun Dong, Wei-Fang Cheng

引用次数: 23

An approximation algorithm for QoS routing with two additive constraints 具有两个附加约束的QoS路由近似算法

2008 IEEE International Conference on Network Protocols Pub Date : 2008-12-08 DOI: 10.1109/ICNP.2008.4697051

Ronghui Hou, K. Lui, Ka-Cheong Leung, F. Baker

引用次数: 10

Link layer multicasting with smart antennas: No client left behind 使用智能天线的链路层多播:不留下客户端

2008 IEEE International Conference on Network Protocols Pub Date : 2008-12-08 DOI: 10.1109/ICNP.2008.4697024

Souvik Sen, Jie Xiong, R. Ghosh, Romit Roy Choudhury

{"title":"Link layer multicasting with smart antennas: No client left behind","authors":"Souvik Sen, Jie Xiong, R. Ghosh, Romit Roy Choudhury","doi":"10.1109/ICNP.2008.4697024","DOIUrl":"https://doi.org/10.1109/ICNP.2008.4697024","url":null,"abstract":"Wireless link layer multicast is an important service primitive for emerging applications, such as live video, streaming audio, and other content telecasts. The broadcast nature of the wireless channel is amenable to multicast because a single packet transmission may be received by all clients in the multicast group. However, in view of diverse channel conditions at different clients, the rate of such a transmission is bottlenecked by the rate of the weakest client. Multicast throughput degrades severely. Attempts to increase the data rate result in lower reliability and higher unfairness. This paper utilizes smart beamforming antennas to improve multicast performance in wireless LANs. The main idea is to satisfy the stronger clients with a high-rate omnidirectional transmission, followed by high-rate directional transmission(s) to cover the weaker ones. By selecting an optimal transmission strategy (using dynamic programming), we show that the multicast throughput can be maximized while achieving a desired delivery ratio at all the clients. We use testbed measurements to verify our main assumptions. We simulate our protocol in Qualnet, and observe consistent performance improvements over a range of client topologies and time-varying channel conditions.","PeriodicalId":301984,"journal":{"name":"2008 IEEE International Conference on Network Protocols","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132663111","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}

引用次数: 47

Experimental evaluation of MAC protocols for fairness and QoS support in wireless networks 无线网络中MAC协议公平性和QoS支持的实验评估

2008 IEEE International Conference on Network Protocols Pub Date : 2008-12-08 DOI: 10.1109/ICNP.2008.4697048

A. Warrier, I. Rhee, J. H. Kim

{"title":"Experimental evaluation of MAC protocols for fairness and QoS support in wireless networks","authors":"A. Warrier, I. Rhee, J. H. Kim","doi":"10.1109/ICNP.2008.4697048","DOIUrl":"https://doi.org/10.1109/ICNP.2008.4697048","url":null,"abstract":"Existing wireless MACs are known to have fairness and QoS problems 1. In response, the wireless community have come up with numerous ldquopoint solutionsrdquo, with one-to-one comparison of their solution with existing MACs for the specific fairness model they target. However, with some tradeoff of flexibility and efficiency, many of these MACs can be made relatively free of a a specific fairness model. This decoupling of the MAC from the fairness model is desirable because it allows objective testing of the MAC under different fairness models and also allows independent evolution of fairness policies and research into medium access issues. However, there is no cross-model evaluation of such MACs especially in the context of real multihop wireless testbeds. In this paper we address this issue by testing three MACs - 802.11e, EY-NPMA and DWOP, (which represent different ways of enabling fairness in the MAC) across a number of fairness and QoS models - temporal/rate and proportional fairness, and EDF and static priority scheduling. In the process we also extend EY-NPMA significantly (which we call Siren) for multihop wireless environments. We perform these comparisons on a 30 node multihop wireless sensor testbed comprising of MicaZ devices equipped with the CC2420 radio.","PeriodicalId":301984,"journal":{"name":"2008 IEEE International Conference on Network Protocols","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131929822","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}

引用次数: 4

Load-aware spectrum distribution in Wireless LANs 无线局域网中负载感知频谱分布

2008 IEEE International Conference on Network Protocols Pub Date : 2008-12-08 DOI: 10.1109/ICNP.2008.4697032

T. Moscibroda, Ranveer Chandra, Yunnan Wu, S. Sengupta, P. Bahl, Yuan Yuan

引用次数: 136

Protocol design for scalable and adaptive multicast for group communications 协议设计的可扩展和自适应组播通信

2008 IEEE International Conference on Network Protocols Pub Date : 2008-12-08 DOI: 10.1109/ICNP.2008.4697022

De-Nian Yang, W. Liao

{"title":"Protocol design for scalable and adaptive multicast for group communications","authors":"De-Nian Yang, W. Liao","doi":"10.1109/ICNP.2008.4697022","DOIUrl":"https://doi.org/10.1109/ICNP.2008.4697022","url":null,"abstract":"Currently, IP multicast and Explicit Multi-Unicast (Xcast) are two approaches for multicast communications. IP multicast is designed for large groups but is not scalable in terms of the group number because every router in a multicast tree needs to store the forwarding state for each group. In contrast, Xcast is designed for small groups and is not scalable in terms of the group size because each packetpsilas header can include only the addresses of a few receivers. Therefore, the two approaches are designed for different scenarios and address different problems. However, the selection of IP multicast or Xcast is left to end users who will choose the corresponding API in the applications. In other words, the scalability of the network relies on the end users, and is not guaranteed by the protocol itself. In this paper, we address the above issues and propose a multicasting protocol that is scalable and adaptive in terms of both group number and group size. We avoid the disadvantages of IP multicast and Xcast by choosing only a few routers to store the forwarding states, and multicast packets are delivered via Xcast among these routers. The main advantage of our protocol is that the assignment of forwarding states is optimal and performed in a fully distributed manner. We show that IP multicast and Xcast are two extreme and special cases of our approach. We prove that the overhead of our protocol is limited. In addition, the assignment of forwarding states in our protocol is adaptive to the dynamic group membership and the change in network topology. Moreover, our protocol is simple and can be extended from existing multicast routing protocols.","PeriodicalId":301984,"journal":{"name":"2008 IEEE International Conference on Network Protocols","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123002997","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}

引用次数: 21

Where’s Waldo? practical searches for stability in iBGP 沃尔多在哪里?对iBGP稳定性的实际探索

2008 IEEE International Conference on Network Protocols Pub Date : 2008-12-08 DOI: 10.1109/ICNP.2008.4697049

A. Flavel, M. Roughan, N. Bean, A. Shaikh

引用次数: 17

Topology dynamics and routing for predictable mobile networks 可预测移动网络的拓扑动力学和路由

2008 IEEE International Conference on Network Protocols Pub Date : 2008-12-08 DOI: 10.1109/ICNP.2008.4697039

Daniel Fischer, D. Basin, T. Engel

引用次数: 43

TCP-Friendly CBR-Like Rate Control tcp友好的类似cbr的速率控制

2008 IEEE International Conference on Network Protocols Pub Date : 2008-12-08 DOI: 10.1109/ICNP.2008.4697036

Jie Feng, Lisong Xu

{"title":"TCP-Friendly CBR-Like Rate Control","authors":"Jie Feng, Lisong Xu","doi":"10.1109/ICNP.2008.4697036","DOIUrl":"https://doi.org/10.1109/ICNP.2008.4697036","url":null,"abstract":"While the current definition of TCP friendliness has enabled a wide variety of traffic control protocols other than TCP, it still considerably restricts the design space of TCP-friendly traffic control protocols. For example, some multimedia streaming applications prefer a smooth sending rate on a time scale of minutes, however, a UDP flow maintaining a smooth sending rate on such a long time scale is naturally not TCP friendly by the current definition. In this paper, we first give a new class of TCP friendliness definitions, called stochastic TCP friendliness, which greatly expands the design space of TCP-friendly traffic control protocols, while still effectively maintaining the desired stability and fairness of the Internet. In particular, we propose stochastic TCP friendliness in usual stochastic order as a more appropriate design guideline for traffic control protocols, which intuitively ensures that a UDP flow is friendly to all competing TCP flows with any increasing utility function. Second, we develop a congestion control protocol, called TCP-friendly CBR-like rate control, which achieves a smooth sending rate on a time scale of minutes, and at the same time is stochastically TCP friendly in usual stochastic order in most network environments.","PeriodicalId":301984,"journal":{"name":"2008 IEEE International Conference on Network Protocols","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122672251","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