Pub Date : 2006-11-30DOI: 10.1109/IWQOS.2006.250482
Gargi Dasgupta, K. Dasgupta, A. Purohit, B. Viswanathan
In this paper, it describes the QoS-GRAF, a framework for providing revenue maximization in a utility computing grid where jobs have multiple resource dependencies and differentiated QoS pricing. To solve the revenue maximization problem the linear relaxation based algorithms, MRPA and MLBA, that achieve performance within 1-5% of the optimal solution and significantly outperform alternative approaches are used. Both show better revenue earnings across small, medium and large jobs, with efficient resource utilization. As a part ongoing work, the backup algorithms for multiple failures is developed. Scheduling algorithms are incorporated to produce maximum profitable schedule considering job deadlines
{"title":"QoS-GRAF: A Framework for QoS based Grid Resource Allocation with Failure provisioning","authors":"Gargi Dasgupta, K. Dasgupta, A. Purohit, B. Viswanathan","doi":"10.1109/IWQOS.2006.250482","DOIUrl":"https://doi.org/10.1109/IWQOS.2006.250482","url":null,"abstract":"In this paper, it describes the QoS-GRAF, a framework for providing revenue maximization in a utility computing grid where jobs have multiple resource dependencies and differentiated QoS pricing. To solve the revenue maximization problem the linear relaxation based algorithms, MRPA and MLBA, that achieve performance within 1-5% of the optimal solution and significantly outperform alternative approaches are used. Both show better revenue earnings across small, medium and large jobs, with efficient resource utilization. As a part ongoing work, the backup algorithms for multiple failures is developed. Scheduling algorithms are incorporated to produce maximum profitable schedule considering job deadlines","PeriodicalId":248938,"journal":{"name":"200614th IEEE International Workshop on Quality of Service","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128992951","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}
Pub Date : 2006-11-30DOI: 10.1109/IWQOS.2006.250457
Gábor Fodor
The current 3GPP working assumption on the evolved universal terrestrial radio access (E-UTRA) physical layer is that it will be based on single carrier frequency division multiple access (SC-FDMA) for the uplink and orthogonal frequency division multiple access (OFDMA) for the downlink. According to the concept specification, inter-cell interference mitigation techniques applicable to SC-FDMA and OFDMA systems are expected to be the key radio resource management techniques for E-UTRA. In this paper we propose and analyze a simple reuse partitioning technique (assuming coordinated sub-carrier allocation in the cells) that is able to minimize inter-cell interference. We propose a model that is able to take into account that sessions dynamically enter and leave the system. Rigid sessions require a class-specific fixed number of sub-carriers, while elastic sessions can enter the system if a minimum number of sub-carriers is allocated to them. In this rather general setting we analyze the system performance in terms of the expected number of sub-carrier collisions, the session blocking probabilities and the signal-to-noise-and-interference ratio performance. We present numerical results on the various trade-offs between these measures that provide insight into the behavior of OFDM based cellular systems and help dimension the parameters of a reuse partitioned system
{"title":"Performance Analysis of a Reuse Partitioning Technique for OFDM Based Evolved UTRA","authors":"Gábor Fodor","doi":"10.1109/IWQOS.2006.250457","DOIUrl":"https://doi.org/10.1109/IWQOS.2006.250457","url":null,"abstract":"The current 3GPP working assumption on the evolved universal terrestrial radio access (E-UTRA) physical layer is that it will be based on single carrier frequency division multiple access (SC-FDMA) for the uplink and orthogonal frequency division multiple access (OFDMA) for the downlink. According to the concept specification, inter-cell interference mitigation techniques applicable to SC-FDMA and OFDMA systems are expected to be the key radio resource management techniques for E-UTRA. In this paper we propose and analyze a simple reuse partitioning technique (assuming coordinated sub-carrier allocation in the cells) that is able to minimize inter-cell interference. We propose a model that is able to take into account that sessions dynamically enter and leave the system. Rigid sessions require a class-specific fixed number of sub-carriers, while elastic sessions can enter the system if a minimum number of sub-carriers is allocated to them. In this rather general setting we analyze the system performance in terms of the expected number of sub-carrier collisions, the session blocking probabilities and the signal-to-noise-and-interference ratio performance. We present numerical results on the various trade-offs between these measures that provide insight into the behavior of OFDM based cellular systems and help dimension the parameters of a reuse partitioned system","PeriodicalId":248938,"journal":{"name":"200614th IEEE International Workshop on Quality of Service","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128119765","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}
Pub Date : 2006-11-30DOI: 10.1109/IWQOS.2006.250446
S. Schmid, F. Kuhn, J. Smit, Roger Wattenhofer
Until now, the analysis of fault tolerance of peer-to-peer systems usually only covers random faults of some kind. Contrary to traditional algorithmic research, faults as well as joins and leaves occurring in a worst-case manner are hardly considered. In this paper, we devise techniques to build dynamic peer-to-peer systems which remain fully functional in spite of an adversary which continuously adds and removes peers. We exemplify our algorithms on a pancake topology and present a system which maintains peer degree and network diameter O(log n/log log n), where n is the total number of peers in the system
{"title":"A Blueprint for Constructing Peer-to-Peer Systems Robust to Dynamic Worst-Case Joins and Leaves","authors":"S. Schmid, F. Kuhn, J. Smit, Roger Wattenhofer","doi":"10.1109/IWQOS.2006.250446","DOIUrl":"https://doi.org/10.1109/IWQOS.2006.250446","url":null,"abstract":"Until now, the analysis of fault tolerance of peer-to-peer systems usually only covers random faults of some kind. Contrary to traditional algorithmic research, faults as well as joins and leaves occurring in a worst-case manner are hardly considered. In this paper, we devise techniques to build dynamic peer-to-peer systems which remain fully functional in spite of an adversary which continuously adds and removes peers. We exemplify our algorithms on a pancake topology and present a system which maintains peer degree and network diameter O(log n/log log n), where n is the total number of peers in the system","PeriodicalId":248938,"journal":{"name":"200614th IEEE International Workshop on Quality of Service","volume":"122 26","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131943556","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}
Pub Date : 2006-11-30DOI: 10.1109/IWQOS.2006.250455
Dan Wang, Qian Zhang, Jiangchuan Liu
Wireless sensor networks have been widely used for surveillance in harsh environments. In many such applications, the environmental data are continuously sensed, and data collection by a server is only performed occasionally. Hence, the sensor nodes have to temporarily store the data, and provide easy and on-hand access for the most updated data when the server approaches. Given the expensive server-to-sensor communications, the large amount of sensors and the limited storage space at each tiny sensor, continuous data collection becomes a challenging problem. In this paper, we present partial network coding (PNC) as a generic tool for the above applications. PNC generalizes the existing network coding (NC) paradigm, an elegant solution for ubiquitous data distribution and collection. Yet, PNC enables efficient storage replacement for continuous data, which is a major deficiency of the conventional NC. We prove that the performance of PNC is quite close to NC, except for a sub-linear overhead on storage and communications. We then address a set of practical concerns toward PNC-based continuous data collection in sensor networks. Its feasibility and superiority are further demonstrated through simulation results
{"title":"Partial Network Coding: Theory and Application for Continuous Sensor Data Collection","authors":"Dan Wang, Qian Zhang, Jiangchuan Liu","doi":"10.1109/IWQOS.2006.250455","DOIUrl":"https://doi.org/10.1109/IWQOS.2006.250455","url":null,"abstract":"Wireless sensor networks have been widely used for surveillance in harsh environments. In many such applications, the environmental data are continuously sensed, and data collection by a server is only performed occasionally. Hence, the sensor nodes have to temporarily store the data, and provide easy and on-hand access for the most updated data when the server approaches. Given the expensive server-to-sensor communications, the large amount of sensors and the limited storage space at each tiny sensor, continuous data collection becomes a challenging problem. In this paper, we present partial network coding (PNC) as a generic tool for the above applications. PNC generalizes the existing network coding (NC) paradigm, an elegant solution for ubiquitous data distribution and collection. Yet, PNC enables efficient storage replacement for continuous data, which is a major deficiency of the conventional NC. We prove that the performance of PNC is quite close to NC, except for a sub-linear overhead on storage and communications. We then address a set of practical concerns toward PNC-based continuous data collection in sensor networks. Its feasibility and superiority are further demonstrated through simulation results","PeriodicalId":248938,"journal":{"name":"200614th IEEE International Workshop on Quality of Service","volume":"416 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122951764","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}
Pub Date : 2006-11-30DOI: 10.1109/IWQOS.2006.250488
W. Lijun, Jianping Wu, Xu Ke
Inter-domain routing stability and convergence delay have significant effect on QoS in Internet RFD is a mechanism to limit route oscillation from spreading wildly and is deemed as a key contributor for Internet routing stability. Recent research discovers that RFD may exacerbate relatively stable routes influenced by path exploration procedure and the interaction between RFD reuse timers. In this paper, a variation of RFD is proposed to deal with the side effect of RFD on routing convergence. Flapping routes are confined by neighboring nodes and invalid routes generated in path exploration are reduced by a RFD-like mechanism more suitable for their characteristics. Simulation results indicate that the modified flap damping mechanism limits persistent flapping routes while causing relatively stable routes converge more quickly
{"title":"A Variation of Route Flap Damping to Improve BGP Routing Convergence","authors":"W. Lijun, Jianping Wu, Xu Ke","doi":"10.1109/IWQOS.2006.250488","DOIUrl":"https://doi.org/10.1109/IWQOS.2006.250488","url":null,"abstract":"Inter-domain routing stability and convergence delay have significant effect on QoS in Internet RFD is a mechanism to limit route oscillation from spreading wildly and is deemed as a key contributor for Internet routing stability. Recent research discovers that RFD may exacerbate relatively stable routes influenced by path exploration procedure and the interaction between RFD reuse timers. In this paper, a variation of RFD is proposed to deal with the side effect of RFD on routing convergence. Flapping routes are confined by neighboring nodes and invalid routes generated in path exploration are reduced by a RFD-like mechanism more suitable for their characteristics. Simulation results indicate that the modified flap damping mechanism limits persistent flapping routes while causing relatively stable routes converge more quickly","PeriodicalId":248938,"journal":{"name":"200614th IEEE International Workshop on Quality of Service","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114200553","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}
Pub Date : 2006-11-30DOI: 10.1109/IWQOS.2006.250469
Hemant Sengar, Haining Wang, D. Wijesekera, S. Jajodia
Recently voice over IP (VoIP) is experiencing a phenomenal growth. Being a real-time service, VoIP is more susceptible to denial-of-service (DoS) attacks than regular Internet services. Moreover, VoIP uses multiple protocols for call control and data delivery, making it vulnerable to various DoS attacks at different protocol layers. An attacker can easily disrupt VoIP services by flooding TCP SYN packets, UDP-based RTP packets, or SIP-based INVITE messages, which pose a critical threat to IP telephony. In this paper, we present an online statistical detection mechanism, called vFDS, to detect DoS attacks in the context of VoIP. The core of vFDS is based on Hellinger distance method, which computes the variability between two probability measures. Using Hellinger distance, we characterize normal protocol behaviors and then detect the traffic anomalies caused by flooding attacks. Our experimental results show that vFDS achieves fast and accurate detection of DoS attacks
{"title":"Fast Detection of Denial-of-Service Attacks on IP Telephony","authors":"Hemant Sengar, Haining Wang, D. Wijesekera, S. Jajodia","doi":"10.1109/IWQOS.2006.250469","DOIUrl":"https://doi.org/10.1109/IWQOS.2006.250469","url":null,"abstract":"Recently voice over IP (VoIP) is experiencing a phenomenal growth. Being a real-time service, VoIP is more susceptible to denial-of-service (DoS) attacks than regular Internet services. Moreover, VoIP uses multiple protocols for call control and data delivery, making it vulnerable to various DoS attacks at different protocol layers. An attacker can easily disrupt VoIP services by flooding TCP SYN packets, UDP-based RTP packets, or SIP-based INVITE messages, which pose a critical threat to IP telephony. In this paper, we present an online statistical detection mechanism, called vFDS, to detect DoS attacks in the context of VoIP. The core of vFDS is based on Hellinger distance method, which computes the variability between two probability measures. Using Hellinger distance, we characterize normal protocol behaviors and then detect the traffic anomalies caused by flooding attacks. Our experimental results show that vFDS achieves fast and accurate detection of DoS attacks","PeriodicalId":248938,"journal":{"name":"200614th IEEE International Workshop on Quality of Service","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121951499","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}
Pub Date : 2006-11-30DOI: 10.1109/IWQOS.2006.250483
M. Malli, C. Barakat, W. Dabbous
In this paper, an enhanced scalable proximity model is described. This work investigates the bandwidth estimation problem and it is impact on the quality of service of the file sharing application. The file transfer application over the TCP protocol is considered and it can be encountered in the emerging file sharing P2P applications or in the replicated Web server context. Since the impact of the bandwidth estimation is the main concern, the large TCP transfer due to its sensitivity to the parameter is considered. Thus considering the delay alone for proximity characterization is far from being optimal for large file transfer applications
{"title":"An Enhanced Scalable Proximity Model","authors":"M. Malli, C. Barakat, W. Dabbous","doi":"10.1109/IWQOS.2006.250483","DOIUrl":"https://doi.org/10.1109/IWQOS.2006.250483","url":null,"abstract":"In this paper, an enhanced scalable proximity model is described. This work investigates the bandwidth estimation problem and it is impact on the quality of service of the file sharing application. The file transfer application over the TCP protocol is considered and it can be encountered in the emerging file sharing P2P applications or in the replicated Web server context. Since the impact of the bandwidth estimation is the main concern, the large TCP transfer due to its sensitivity to the parameter is considered. Thus considering the delay alone for proximity characterization is far from being optimal for large file transfer applications","PeriodicalId":248938,"journal":{"name":"200614th IEEE International Workshop on Quality of Service","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130401154","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}
Pub Date : 2006-11-30DOI: 10.1109/IWQOS.2006.250454
O. Chipara, Zhimin He, G. Xing, Qin Chen, Xiaorui Wang, Chenyang Lu, J. Stankovic, T. Abdelzaher
Many wireless sensor network applications must resolve the inherent conflict between energy efficient communication and the need to achieve desired quality of service such as end-to-end communication delay. To address this challenge, we propose the real-time power-aware routing (RPAR) protocol, which achieves application-specified communication delays at low energy cost by dynamically adapting transmission power and routing decisions. RPAR features a power-aware forwarding policy and an efficient neighborhood manager that are optimized for resource-constrained wireless sensors. Moreover, RPAR addresses important practical issues in wireless sensor networks, including lossy links, scalability, and severe memory and bandwidth constraints. Simulations based on a realistic radio model of MICA2 motes show that RPAR significantly reduces the number of deadlines missed and energy consumption compared to existing real-time and energy-efficient routing protocols
{"title":"Real-time Power-Aware Routing in Sensor Networks","authors":"O. Chipara, Zhimin He, G. Xing, Qin Chen, Xiaorui Wang, Chenyang Lu, J. Stankovic, T. Abdelzaher","doi":"10.1109/IWQOS.2006.250454","DOIUrl":"https://doi.org/10.1109/IWQOS.2006.250454","url":null,"abstract":"Many wireless sensor network applications must resolve the inherent conflict between energy efficient communication and the need to achieve desired quality of service such as end-to-end communication delay. To address this challenge, we propose the real-time power-aware routing (RPAR) protocol, which achieves application-specified communication delays at low energy cost by dynamically adapting transmission power and routing decisions. RPAR features a power-aware forwarding policy and an efficient neighborhood manager that are optimized for resource-constrained wireless sensors. Moreover, RPAR addresses important practical issues in wireless sensor networks, including lossy links, scalability, and severe memory and bandwidth constraints. Simulations based on a realistic radio model of MICA2 motes show that RPAR significantly reduces the number of deadlines missed and energy consumption compared to existing real-time and energy-efficient routing protocols","PeriodicalId":248938,"journal":{"name":"200614th IEEE International Workshop on Quality of Service","volume":"182 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129441205","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}
Pub Date : 2006-11-30DOI: 10.1109/IWQOS.2006.250461
Kamal Gakhar, M. Achir, A. Gravey
This paper presents a mechanism for dynamic resource management and discusses its relevance for traffic in IEEE 802.16 broadband wireless network. The basic goal is to minimize the amount of bandwidth being actually provisioned for committed bandwidth traffic while keeping the cost of MAC signalling to a minimum. In particular, this mechanism restricts the provisioned bandwidth to a predefined minimum when the actual offered load is significantly lower than the load that has been taken as a dimensioning objective. The proposed mechanism dynamically changes the amount of reserved resources between a small number of values (two in the base model) depending on the actual number of active connections while limiting the number of transitions by imposing a hysteresis behaviour. In particular, it is not necessary to update the resource reservation whenever a traffic flow is activated or terminated. A Markov chain model yields two performance parameters: the reserved bandwidth and the transition rate. A new parameter, noted thetas, has been introduced in addition to the performance parameters discussed to minimize the global cost of the system. A generalization of this method to more than a single threshold is also proposed and discussed
{"title":"Dynamic Resource Reservation in IEEE 802.16 Broadband Wireless Networks","authors":"Kamal Gakhar, M. Achir, A. Gravey","doi":"10.1109/IWQOS.2006.250461","DOIUrl":"https://doi.org/10.1109/IWQOS.2006.250461","url":null,"abstract":"This paper presents a mechanism for dynamic resource management and discusses its relevance for traffic in IEEE 802.16 broadband wireless network. The basic goal is to minimize the amount of bandwidth being actually provisioned for committed bandwidth traffic while keeping the cost of MAC signalling to a minimum. In particular, this mechanism restricts the provisioned bandwidth to a predefined minimum when the actual offered load is significantly lower than the load that has been taken as a dimensioning objective. The proposed mechanism dynamically changes the amount of reserved resources between a small number of values (two in the base model) depending on the actual number of active connections while limiting the number of transitions by imposing a hysteresis behaviour. In particular, it is not necessary to update the resource reservation whenever a traffic flow is activated or terminated. A Markov chain model yields two performance parameters: the reserved bandwidth and the transition rate. A new parameter, noted thetas, has been introduced in addition to the performance parameters discussed to minimize the global cost of the system. A generalization of this method to more than a single threshold is also proposed and discussed","PeriodicalId":248938,"journal":{"name":"200614th IEEE International Workshop on Quality of Service","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114934497","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}
Considered is a mobile ad hoc network consisting of three types of nodes (source, destination and relay nodes) and using the two-hop relay routing protocol. Packets at relay nodes are assumed to have a limited lifetime in the network. All nodes are moving inside a bounded region according to some random mobility model. Both closed-form expressions, and asymptotic results are provided for the packet delivery delay and the energy needed to transmit a packet from the source to its destination. Our model is validated through simulations for two mobility models (random waypoint and random direction mobility models), numerical results for the two-hop relay protocols are reported, and the performance of the two-hop routing and of the epidemic routing protocols are compared
{"title":"Performance of Ad Hoc Networks with Two-Hop Relay Routing and Limited Packet Lifetime","authors":"Ahmad Al Hanbali, P. Nain, E. Altman","doi":"10.1145/1190095.1190158","DOIUrl":"https://doi.org/10.1145/1190095.1190158","url":null,"abstract":"Considered is a mobile ad hoc network consisting of three types of nodes (source, destination and relay nodes) and using the two-hop relay routing protocol. Packets at relay nodes are assumed to have a limited lifetime in the network. All nodes are moving inside a bounded region according to some random mobility model. Both closed-form expressions, and asymptotic results are provided for the packet delivery delay and the energy needed to transmit a packet from the source to its destination. Our model is validated through simulations for two mobility models (random waypoint and random direction mobility models), numerical results for the two-hop relay protocols are reported, and the performance of the two-hop routing and of the epidemic routing protocols are compared","PeriodicalId":248938,"journal":{"name":"200614th IEEE International Workshop on Quality of Service","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129798916","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
扫码关注我们
求助内容：
应助结果提醒方式：