Routing is one of the most important reasons behind clustering in MANETs. However, the frequent changes of the clusterheads affect the performance of the routing protocol. The route between two nodes changes constantly as the clusterhead set changes. Maintaining and minimizing the routes interruptions are two ways of keeping the stability of the network. We claim that the lifetime of a particular route is dependent on all the clusterheads involved in this route. By maintaining the route lifetime, we can keep the network in stable condition as long as possible. Therefore, we propose a localized cluster-based rerouting and resource reservation (LC3R) protocol with packet redundancy over primary and secondary clusterhead chains. This protocol intends to improve the performance of MANETs by increasing the route lifetime to enhance the network stability and developing a reliable cluster-based routing protocol to support the QoS requirements.
{"title":"Localized cluster-based re-routing and resource reservation in mobile ad hoc networks","authors":"M. Al-kahtani, H. Mouftah","doi":"10.1109/ICW.2005.55","DOIUrl":"https://doi.org/10.1109/ICW.2005.55","url":null,"abstract":"Routing is one of the most important reasons behind clustering in MANETs. However, the frequent changes of the clusterheads affect the performance of the routing protocol. The route between two nodes changes constantly as the clusterhead set changes. Maintaining and minimizing the routes interruptions are two ways of keeping the stability of the network. We claim that the lifetime of a particular route is dependent on all the clusterheads involved in this route. By maintaining the route lifetime, we can keep the network in stable condition as long as possible. Therefore, we propose a localized cluster-based rerouting and resource reservation (LC3R) protocol with packet redundancy over primary and secondary clusterhead chains. This protocol intends to improve the performance of MANETs by increasing the route lifetime to enhance the network stability and developing a reliable cluster-based routing protocol to support the QoS requirements.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132121887","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}
P2P networks have been proposed as a scalable, inexpensive solution to the problem of distributing multimedia content over the Internet. Since real P2P systems exhibit considerable heterogeneity in hardware, software and network connections, the design of P2P streaming networks must factor in this variation. There are two different sources of heterogeneity in P2P networks. Most existing work in the literature handle heterogeneity among receivers and requirements by the use of different multimedia encodings of the same content. In this paper we focus on the problems caused by heterogeneity in the network delays connecting receivers to the sender We assume that there is a single multicast tree and a single video stream. We propose new algorithms for building multicast trees for multimedia streaming in heterogeneous P2P networks. Our algorithms differ in the amount of communication and computational resources they require. We compare the performance (using simulations) of our algorithms with an existing Zigzag algorithm. Our results show that two of our algorithms ( FollowTree-Landmark-II algorithm and FollowTree algorithm) significantly outperform Zigzag.
{"title":"Building multicast trees for multimedia streaming in heterogeneous P2P networks","authors":"Xiangrong Tan, S. Datta","doi":"10.1109/ICW.2005.33","DOIUrl":"https://doi.org/10.1109/ICW.2005.33","url":null,"abstract":"P2P networks have been proposed as a scalable, inexpensive solution to the problem of distributing multimedia content over the Internet. Since real P2P systems exhibit considerable heterogeneity in hardware, software and network connections, the design of P2P streaming networks must factor in this variation. There are two different sources of heterogeneity in P2P networks. Most existing work in the literature handle heterogeneity among receivers and requirements by the use of different multimedia encodings of the same content. In this paper we focus on the problems caused by heterogeneity in the network delays connecting receivers to the sender We assume that there is a single multicast tree and a single video stream. We propose new algorithms for building multicast trees for multimedia streaming in heterogeneous P2P networks. Our algorithms differ in the amount of communication and computational resources they require. We compare the performance (using simulations) of our algorithms with an existing Zigzag algorithm. Our results show that two of our algorithms ( FollowTree-Landmark-II algorithm and FollowTree algorithm) significantly outperform Zigzag.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"9 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132973834","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}
Network emulations are imitations of real-time network behavior that help in testing and assessing protocols, and other network related applications in a controlled hardware and software environment. Most of the emulators existing today are hardware implemented emulators. There is a rising demand to emulate the network behavior using a software tool. Our Internet delay emulator (IDEM) is a software tool that captures the network details and reproduces an environment useful for research oriented projects. IDEM is based on bouncers that are distributed over the Internet. The concepts of firewall routing are used in designing IDEM. IDEM supports both TCP and UDP applications. Rigorous testing shows that actual delay in data sent is accurately modeled by IDEM. Advantages of IDEM especially for delay sensitive applications like VoIP are discussed.
{"title":"IDEM: an Internet delay emulator approach for assessing VoIP quality","authors":"S. Naik, E. Aboelela","doi":"10.1109/ICW.2005.50","DOIUrl":"https://doi.org/10.1109/ICW.2005.50","url":null,"abstract":"Network emulations are imitations of real-time network behavior that help in testing and assessing protocols, and other network related applications in a controlled hardware and software environment. Most of the emulators existing today are hardware implemented emulators. There is a rising demand to emulate the network behavior using a software tool. Our Internet delay emulator (IDEM) is a software tool that captures the network details and reproduces an environment useful for research oriented projects. IDEM is based on bouncers that are distributed over the Internet. The concepts of firewall routing are used in designing IDEM. IDEM supports both TCP and UDP applications. Rigorous testing shows that actual delay in data sent is accurately modeled by IDEM. Advantages of IDEM especially for delay sensitive applications like VoIP are discussed.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133475558","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}
We describe the design, implementation and performance of a stand-alone media server. This server is intended to be used in voice over IP systems for audio interaction with users, NAT traversal, call monitoring and media recording. Its advantage is that it is application independent, which means that it can be used by any service and for any signaling protocol. In this paper we describe the design of the server, of its control protocol and of its functionalities such as file playing, DTMF detection, RTP proxying and audio recording. For file playing, we propose an approach to schedule RTP packet transmission that overcomes the irregularity of event scheduling of the operating system and for conversation recording, we propose an original approach to synchronize media streams that allows to avoid voice overlap while recording a conversation. We have conducted many experiments on the media server. We evaluated the accuracy of the file playing timing under different load conditions, the effect of the RTP proxying on the media quality and the subjective quality of recorded conversations. The results of these experiments show the great impact of the load of the media server on the performance of its functionalities, the improvement that the packet scheduling algorithm brings to the precision of inter-departure timing, and the good subjective quality of the recorded conversation using our synchronizing approach.
{"title":"Design and performance of a stand-alone media server","authors":"H. Khlifi, Jean-Charles Grégoire","doi":"10.1109/ICW.2005.40","DOIUrl":"https://doi.org/10.1109/ICW.2005.40","url":null,"abstract":"We describe the design, implementation and performance of a stand-alone media server. This server is intended to be used in voice over IP systems for audio interaction with users, NAT traversal, call monitoring and media recording. Its advantage is that it is application independent, which means that it can be used by any service and for any signaling protocol. In this paper we describe the design of the server, of its control protocol and of its functionalities such as file playing, DTMF detection, RTP proxying and audio recording. For file playing, we propose an approach to schedule RTP packet transmission that overcomes the irregularity of event scheduling of the operating system and for conversation recording, we propose an original approach to synchronize media streams that allows to avoid voice overlap while recording a conversation. We have conducted many experiments on the media server. We evaluated the accuracy of the file playing timing under different load conditions, the effect of the RTP proxying on the media quality and the subjective quality of recorded conversations. The results of these experiments show the great impact of the load of the media server on the performance of its functionalities, the improvement that the packet scheduling algorithm brings to the precision of inter-departure timing, and the good subjective quality of the recorded conversation using our synchronizing approach.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133943532","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}
A QoS provisioned CIOQ switch using crossbar structure with m parallel lines per output port is proposed in this paper. The packets at input buffers are transferred to the output buffers by means of mxN internal lines. Since all internal lines have the same speed as external links, no internal clock speedup is required so that the proposed structure is suited for high-speed switches. The switch models for analysis are proposed and its performances are evaluated by means of queuing theory. The results show that only 2 internal links for each output port are sufficient for quick packet transfer from the input buffers to the output buffers. The proposed switch has also the feature that facilitates the choice of scheduler in order to satisfy the QoS of each class of service.
{"title":"A QoS provisioned CIOQ packet switch using crossbar structure with m internal links","authors":"C. R. D. Santos, S. Motoyama","doi":"10.1109/ICW.2005.15","DOIUrl":"https://doi.org/10.1109/ICW.2005.15","url":null,"abstract":"A QoS provisioned CIOQ switch using crossbar structure with m parallel lines per output port is proposed in this paper. The packets at input buffers are transferred to the output buffers by means of mxN internal lines. Since all internal lines have the same speed as external links, no internal clock speedup is required so that the proposed structure is suited for high-speed switches. The switch models for analysis are proposed and its performances are evaluated by means of queuing theory. The results show that only 2 internal links for each output port are sufficient for quick packet transfer from the input buffers to the output buffers. The proposed switch has also the feature that facilitates the choice of scheduler in order to satisfy the QoS of each class of service.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117183780","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}
The MPEG-4 standard includes support not only for natural video and audio, but also for synthetic graphics and sounds. In the MPEG-4 specifications, body animation parameters (BAPs) and body definition parameters (BDPs) allow virtual bodies and their animation to be compressed using a standard compression pipeline comprising of quantization, predictive encoding and arithmetic coding of these parameters. In this paper, we propose and implement a new stage within the standard prediction-based compression pipeline for the BAPs, termed as BAP sparsing. BAP sparsing compresses a complete block of motion data, consisting of an initial 1-frame followed by subsequent P-frames, required for creating the animation. It exploits the inherent hierarchical structure of the human skeletal model to intelligently drop and modify the P-frames, while preserving animation quality. BAP sparsing is shown to result in superior compression of the BAP data, with negligible loss in the motion animation quality. It is also shown to result in a lower network throughput requirement and fewer CPU cycles on the client end to create the animation. The proposed method is particularly well suited for animation using BAP data.
{"title":"BAP sparsing: a novel approach to MPEG-4 body animation parameter compression","authors":"Siddhartha Chattopadhyay, S. Bhandarkar, Kang Li","doi":"10.1109/ICW.2005.32","DOIUrl":"https://doi.org/10.1109/ICW.2005.32","url":null,"abstract":"The MPEG-4 standard includes support not only for natural video and audio, but also for synthetic graphics and sounds. In the MPEG-4 specifications, body animation parameters (BAPs) and body definition parameters (BDPs) allow virtual bodies and their animation to be compressed using a standard compression pipeline comprising of quantization, predictive encoding and arithmetic coding of these parameters. In this paper, we propose and implement a new stage within the standard prediction-based compression pipeline for the BAPs, termed as BAP sparsing. BAP sparsing compresses a complete block of motion data, consisting of an initial 1-frame followed by subsequent P-frames, required for creating the animation. It exploits the inherent hierarchical structure of the human skeletal model to intelligently drop and modify the P-frames, while preserving animation quality. BAP sparsing is shown to result in superior compression of the BAP data, with negligible loss in the motion animation quality. It is also shown to result in a lower network throughput requirement and fewer CPU cycles on the client end to create the animation. The proposed method is particularly well suited for animation using BAP data.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124920028","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}
Large-scale networks of mobile agents autonomously performing long-term sensing and communication tasks will be foreseeable in the near future. Since nodes in such a system communicate in a multi-hop fashion and the environment may be constantly changing due to the mobility, it is important for such a system to be able to tolerate temporary node failures. Moreover it would be ideal if the communications between nodes are not interrupted while nodes are moving around. In this paper we present a provably correct distributed rendezvous algorithm to achieve both goals by making the underlying communication graph biconnected. The proposed algorithm only requires relative position information of each node and works both synchronously and asynchronously. We further propose for each node a sleep/awake power control schedule in conjunction with the node's mobility strategy to compensate the energy consumption due to the node's movement.
{"title":"Distributed mobility control for fault-tolerant mobile networks","authors":"Jie Lin","doi":"10.1109/ICW.2005.42","DOIUrl":"https://doi.org/10.1109/ICW.2005.42","url":null,"abstract":"Large-scale networks of mobile agents autonomously performing long-term sensing and communication tasks will be foreseeable in the near future. Since nodes in such a system communicate in a multi-hop fashion and the environment may be constantly changing due to the mobility, it is important for such a system to be able to tolerate temporary node failures. Moreover it would be ideal if the communications between nodes are not interrupted while nodes are moving around. In this paper we present a provably correct distributed rendezvous algorithm to achieve both goals by making the underlying communication graph biconnected. The proposed algorithm only requires relative position information of each node and works both synchronously and asynchronously. We further propose for each node a sleep/awake power control schedule in conjunction with the node's mobility strategy to compensate the energy consumption due to the node's movement.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131039202","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}
The highly dynamic topology of ad hoc networks and their limited bandwidth made the routing task more difficult. Actually, various kinds of sources (such as voice, video, or data) with diverse traffic characteristics and quality of service requirements (QoS) are multiplexed at very high rates, leads to significant traffic problems such as packet losses, transmission delays, delay variations, etc, caused mainly by congestion in the networks. The prediction of these problems in real time is quite difficult, making the effectiveness of "traditional" protocols based on analytical models questionable. We propose in this paper a state of the art of this problem followed by a solution based on reinforcement learning paradigm that we find more adapted for this kind of problems.
ad hoc网络的高度动态拓扑结构和有限的带宽使得路由任务更加困难。实际上，具有不同流量特征和服务质量要求(QoS)的各种源(如语音、视频或数据)以非常高的速率进行多路复用，导致主要由网络拥塞引起的丢包、传输延迟、延迟变化等显著的流量问题。这些问题的实时预测是相当困难的，这使得基于分析模型的“传统”协议的有效性受到质疑。我们在本文中提出了这个问题的最新技术，然后是一个基于强化学习范式的解决方案，我们发现它更适合这类问题。
{"title":"A swarm intelligent scheme for routing in mobile ad hoc networks","authors":"S. Ziane, A. Mellouk","doi":"10.1109/ICW.2005.18","DOIUrl":"https://doi.org/10.1109/ICW.2005.18","url":null,"abstract":"The highly dynamic topology of ad hoc networks and their limited bandwidth made the routing task more difficult. Actually, various kinds of sources (such as voice, video, or data) with diverse traffic characteristics and quality of service requirements (QoS) are multiplexed at very high rates, leads to significant traffic problems such as packet losses, transmission delays, delay variations, etc, caused mainly by congestion in the networks. The prediction of these problems in real time is quite difficult, making the effectiveness of \"traditional\" protocols based on analytical models questionable. We propose in this paper a state of the art of this problem followed by a solution based on reinforcement learning paradigm that we find more adapted for this kind of problems.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131044696","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}
In terms of improving TCP performance in Mobile Ad Hoc-NETwork (MANET), it is well known that small congestion window size of TCP connection improves TCP performance. We propose a new TCP algorithm to improve TCP performance in MANET. The basic idea of our approach is that TCP receiver estimates the optimum window size and then sets congestion window limit to an optimal value by the advertised window. It is found that our algorithm, using ns-2 simulator, improves TCP performance up to 60% in various topologies in MANET.
{"title":"A new tuning maximum congestion window for improving TCP performance in MANET","authors":"Kwan-Woong Kim, P. Lorenz, Mike-Myung-Ok Lee","doi":"10.1109/ICW.2005.13","DOIUrl":"https://doi.org/10.1109/ICW.2005.13","url":null,"abstract":"In terms of improving TCP performance in Mobile Ad Hoc-NETwork (MANET), it is well known that small congestion window size of TCP connection improves TCP performance. We propose a new TCP algorithm to improve TCP performance in MANET. The basic idea of our approach is that TCP receiver estimates the optimum window size and then sets congestion window limit to an optimal value by the advertised window. It is found that our algorithm, using ns-2 simulator, improves TCP performance up to 60% in various topologies in MANET.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125712233","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}
M. Morón, E. Casilari-Pérez, R. Luque, J. A. G. Parra
This paper presents a wireless medical monitoring system. The system permits to receive and process in a single concentrator node (e.g. a laptop or a simple handheld device) the pulse-oximetry signals from one ore several monitored patients without using any wired infrastructure. The system, which is based on a piconet of Bluetooth sensors, can retransmit the medical signals by WLAN and GPRS. The paper describes the practical application scenarios in which this type of systems could be of great utility.
{"title":"A wireless monitoring system for pulse-oximetry sensors","authors":"M. Morón, E. Casilari-Pérez, R. Luque, J. A. G. Parra","doi":"10.1109/ICW.2005.20","DOIUrl":"https://doi.org/10.1109/ICW.2005.20","url":null,"abstract":"This paper presents a wireless medical monitoring system. The system permits to receive and process in a single concentrator node (e.g. a laptop or a simple handheld device) the pulse-oximetry signals from one ore several monitored patients without using any wired infrastructure. The system, which is based on a piconet of Bluetooth sensors, can retransmit the medical signals by WLAN and GPRS. The paper describes the practical application scenarios in which this type of systems could be of great utility.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127759897","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：