Pub Date : 2016-07-11DOI: 10.1109/WMNC.2016.7543929
C. Olariu, Adriana Hava
In this paper we propose a mechanism entitled Delay-Aware Packet Prioritisation (DAPP) that works at WiFi packet queue level. DAPP enqueues packets according to their time spent in the network, such that more delayed packets are enqueued towards the head of the queue. We study the effects of such an approach in wireless multi-hop scenarios where VoIP packets with various delay impairments reach a congested node. Packets' delay builds up as congestion increases and we show that DAPP improves a network's VoIP capacity by distributing the negative effects of delay to those VoIP packets that so far travelled in good network conditions. This is to the advantage of those VoIP packets already negatively affected by network conditions, as they are allowed to pass a congested node with less further delay accumulation. We use extensive NS-3 simulations where a wide range of network impairments affect VoIP calls, and we demonstrate that DAPP is able to improve the VoIP capacity and fairness among VoIP calls in a wireless multi-hop network.
{"title":"DAPP: A Delay-Aware Packet Prioritisation scheme for VoIP in wireless multi-hop networks","authors":"C. Olariu, Adriana Hava","doi":"10.1109/WMNC.2016.7543929","DOIUrl":"https://doi.org/10.1109/WMNC.2016.7543929","url":null,"abstract":"In this paper we propose a mechanism entitled Delay-Aware Packet Prioritisation (DAPP) that works at WiFi packet queue level. DAPP enqueues packets according to their time spent in the network, such that more delayed packets are enqueued towards the head of the queue. We study the effects of such an approach in wireless multi-hop scenarios where VoIP packets with various delay impairments reach a congested node. Packets' delay builds up as congestion increases and we show that DAPP improves a network's VoIP capacity by distributing the negative effects of delay to those VoIP packets that so far travelled in good network conditions. This is to the advantage of those VoIP packets already negatively affected by network conditions, as they are allowed to pass a congested node with less further delay accumulation. We use extensive NS-3 simulations where a wide range of network impairments affect VoIP calls, and we demonstrate that DAPP is able to improve the VoIP capacity and fairness among VoIP calls in a wireless multi-hop network.","PeriodicalId":290227,"journal":{"name":"2016 9th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126070034","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 : 2016-07-11DOI: 10.1109/WMNC.2016.7543978
Imane Rahmouni, Sidi Ahmed Ezzahidi, Ahmed El Ouadrhiri, Mohamed El-Kamili, Essaid Sabir
The mobile nodes in delay tolerant networks communicate with each other using a store-carry and forward mechanism even though there is no permanent link between the source and the destination. This mechanism requires cooperation between nodes. However, because of limited resources such as storage and energy, most of the nodes act in a non-cooperative way. In this paper, an incentive mechanism is proposed to encourage messages caching in DTNs. The source offers a reward to the relays to incite them to participate in delivering the message to the destination. We model the interaction between the source and the relays as a Stackelberg game in which the source takes the role of the leader and the relays respond based on the leader's move. Also, two different learning algorithms are presented: one for the leader, the other for the followers, to allow them to take the best decision and finally, to converge to the Stackelberg Equilibrium.
{"title":"A hierarchical caching game for message relaying in delay tolerant networks","authors":"Imane Rahmouni, Sidi Ahmed Ezzahidi, Ahmed El Ouadrhiri, Mohamed El-Kamili, Essaid Sabir","doi":"10.1109/WMNC.2016.7543978","DOIUrl":"https://doi.org/10.1109/WMNC.2016.7543978","url":null,"abstract":"The mobile nodes in delay tolerant networks communicate with each other using a store-carry and forward mechanism even though there is no permanent link between the source and the destination. This mechanism requires cooperation between nodes. However, because of limited resources such as storage and energy, most of the nodes act in a non-cooperative way. In this paper, an incentive mechanism is proposed to encourage messages caching in DTNs. The source offers a reward to the relays to incite them to participate in delivering the message to the destination. We model the interaction between the source and the relays as a Stackelberg game in which the source takes the role of the leader and the relays respond based on the leader's move. Also, two different learning algorithms are presented: one for the leader, the other for the followers, to allow them to take the best decision and finally, to converge to the Stackelberg Equilibrium.","PeriodicalId":290227,"journal":{"name":"2016 9th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122094940","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 : 2016-07-11DOI: 10.1109/WMNC.2016.7543979
Ye Tao, Xin Li, Manabu Tsukada, H. Esaki
Position-based Routing Vehicular Ad-hoc Network (PBR-VANET) is a specific type of mobile Ad-hoc network where the nodes are present as vehicles and the routing is decided based on node position. However, PBR-VANET routing protocols greatly suffer from mass packet loss due to frequent changes in topology. We discuss the requirements of the routing protocol and propose a routing encapsulation protocol called Duplicated Unicast Packet Encapsulation (DUPE). The protocol is compatible with original GeoNetworking standard, and can cooperate with the existing implementations without modification to neither GeoNetworking infrastructure nor user applications. The protocol encapsulates GeoNetworking packet in BTP packet (a Layer 4 protocol in GeoNetworking) and duplicates the original packet into different paths to reduce packet loss caused by failure and stale paths. The evaluations on DUPE in different scenarios show that, with reasonable latency and bandwidth overhead achieved, packet loss in certain scenarios is eliminated, where standard GeoNetworking protocol has packet loss of up to 94.5% in worst case.
{"title":"DUPE: Duplicated Unicast Packet Encapsulation in Position-based Routing VANET","authors":"Ye Tao, Xin Li, Manabu Tsukada, H. Esaki","doi":"10.1109/WMNC.2016.7543979","DOIUrl":"https://doi.org/10.1109/WMNC.2016.7543979","url":null,"abstract":"Position-based Routing Vehicular Ad-hoc Network (PBR-VANET) is a specific type of mobile Ad-hoc network where the nodes are present as vehicles and the routing is decided based on node position. However, PBR-VANET routing protocols greatly suffer from mass packet loss due to frequent changes in topology. We discuss the requirements of the routing protocol and propose a routing encapsulation protocol called Duplicated Unicast Packet Encapsulation (DUPE). The protocol is compatible with original GeoNetworking standard, and can cooperate with the existing implementations without modification to neither GeoNetworking infrastructure nor user applications. The protocol encapsulates GeoNetworking packet in BTP packet (a Layer 4 protocol in GeoNetworking) and duplicates the original packet into different paths to reduce packet loss caused by failure and stale paths. The evaluations on DUPE in different scenarios show that, with reasonable latency and bandwidth overhead achieved, packet loss in certain scenarios is eliminated, where standard GeoNetworking protocol has packet loss of up to 94.5% in worst case.","PeriodicalId":290227,"journal":{"name":"2016 9th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124489865","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 : 2016-07-11DOI: 10.1109/WMNC.2016.7543974
Sarra Messai, Abdellah Boukerram, H. Seba
To save energy in Wireless Sensor Networks (WSNs) and prolong the network lifetime, many works investigate the use of one or more mobile sinks. These solutions are mainly based on organizing the network within a grid to simplify the computation of the sink trajectory. However, existing solutions do not take into account energy consumption during grid construction and do not scale when the sink has to visit every cell of the network grid. To overcome this drawback, we propose an energy-based cell-head selection combined with two sink mobility algorithms to minimize energy consumption of sensor nodes and optimize data collection. Experimentation results confirm the efficiency of our algorithms compared to two basics schemes, i.e. static sink and random sink mobility and also to the related work.
{"title":"Energy-efficient data collection in grid-based Wireless Sensor Networks using a mobile sink","authors":"Sarra Messai, Abdellah Boukerram, H. Seba","doi":"10.1109/WMNC.2016.7543974","DOIUrl":"https://doi.org/10.1109/WMNC.2016.7543974","url":null,"abstract":"To save energy in Wireless Sensor Networks (WSNs) and prolong the network lifetime, many works investigate the use of one or more mobile sinks. These solutions are mainly based on organizing the network within a grid to simplify the computation of the sink trajectory. However, existing solutions do not take into account energy consumption during grid construction and do not scale when the sink has to visit every cell of the network grid. To overcome this drawback, we propose an energy-based cell-head selection combined with two sink mobility algorithms to minimize energy consumption of sensor nodes and optimize data collection. Experimentation results confirm the efficiency of our algorithms compared to two basics schemes, i.e. static sink and random sink mobility and also to the related work.","PeriodicalId":290227,"journal":{"name":"2016 9th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115804796","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 : 2016-07-11DOI: 10.1109/WMNC.2016.7543981
Yuma Yamada, A. Uchiyama, Akihito Hiromori, H. Yamaguchi, T. Higashino
We propose a method to estimate people travel modes and trajectories from control signal records (CSRs) generated at cellular base stations (BSs) when mobile phones send BSs any signal such as handover and data transmission. User locations can be roughly identified by BS IDs in the records as well as the locations of BSs. However, the location accuracy depends on BS cell size, which is not enough to estimate people travels. Therefore, our method leverages geographical information such as stations, railway networks and road networks. We firstly extract railway passengers and automobile travelers based on roughly estimated speeds and trajectories. Then, we further estimate trajectories for automobiles and boarded trains for railway passengers by applying maximum likelihood estimation. Simulation results show that our method achieves 88% recall and 89% precision for railway passenger identification and 85% accuracy for boarded train identification if each mobile phone's communication frequency exceeds 9 times per hour. For automobile travels, our method achieves 75% recall and 70% precision for identification and 64% accuracy for trajectory estimation.
{"title":"Travel estimation using Control Signal Records in cellular networks and geographical information","authors":"Yuma Yamada, A. Uchiyama, Akihito Hiromori, H. Yamaguchi, T. Higashino","doi":"10.1109/WMNC.2016.7543981","DOIUrl":"https://doi.org/10.1109/WMNC.2016.7543981","url":null,"abstract":"We propose a method to estimate people travel modes and trajectories from control signal records (CSRs) generated at cellular base stations (BSs) when mobile phones send BSs any signal such as handover and data transmission. User locations can be roughly identified by BS IDs in the records as well as the locations of BSs. However, the location accuracy depends on BS cell size, which is not enough to estimate people travels. Therefore, our method leverages geographical information such as stations, railway networks and road networks. We firstly extract railway passengers and automobile travelers based on roughly estimated speeds and trajectories. Then, we further estimate trajectories for automobiles and boarded trains for railway passengers by applying maximum likelihood estimation. Simulation results show that our method achieves 88% recall and 89% precision for railway passenger identification and 85% accuracy for boarded train identification if each mobile phone's communication frequency exceeds 9 times per hour. For automobile travels, our method achieves 75% recall and 70% precision for identification and 64% accuracy for trajectory estimation.","PeriodicalId":290227,"journal":{"name":"2016 9th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125028082","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 : 2016-07-11DOI: 10.1109/WMNC.2016.7543989
A. Al-Ani, J. Seitz
In this work, we propose an adaptive congestion control and avoidance mechanism as an enhancement to our earlier proposed QoS-aware routing protocol. We utilize Ant Colony Optimization (ACO) algorithms for adaptive multipath routing and use the monitoring feature of the Simple Network Management Protocol (SNMP) for QoS computation. So, merging these two methodologies we propose a powerful adaptive multipath QoS-aware routing protocol based on ACO (QoRA). The adaptive nature of QoRA signifies the support of multi-rate data transmission determined by the QoS constraints available on the path. The QoRA routing protocol firstly determines multiple routes based on the applications QoS requirements. Secondly, the congestion control mechanism of QoRA prevents the communication flow from entering into the congested node. QoRA performance is tested for real-time multimedia applications over realistic scenarios simulated using SUMO. The real-time video applications are simulated using H.264/SVC encoded video trace files. We provide an in-depth discussion of the operation of the QoRA routing protocol, which is implemented in the ns-3 simulator. The results obtained after simulation indicates that the enhanced QoRA approach shows better performance for delay and jitter constraints in urban scenarios for multimedia applications as compared to our earlier approach.
{"title":"QoS-aware routing for video streaming in multi-rate Ad hoc Networks","authors":"A. Al-Ani, J. Seitz","doi":"10.1109/WMNC.2016.7543989","DOIUrl":"https://doi.org/10.1109/WMNC.2016.7543989","url":null,"abstract":"In this work, we propose an adaptive congestion control and avoidance mechanism as an enhancement to our earlier proposed QoS-aware routing protocol. We utilize Ant Colony Optimization (ACO) algorithms for adaptive multipath routing and use the monitoring feature of the Simple Network Management Protocol (SNMP) for QoS computation. So, merging these two methodologies we propose a powerful adaptive multipath QoS-aware routing protocol based on ACO (QoRA). The adaptive nature of QoRA signifies the support of multi-rate data transmission determined by the QoS constraints available on the path. The QoRA routing protocol firstly determines multiple routes based on the applications QoS requirements. Secondly, the congestion control mechanism of QoRA prevents the communication flow from entering into the congested node. QoRA performance is tested for real-time multimedia applications over realistic scenarios simulated using SUMO. The real-time video applications are simulated using H.264/SVC encoded video trace files. We provide an in-depth discussion of the operation of the QoRA routing protocol, which is implemented in the ns-3 simulator. The results obtained after simulation indicates that the enhanced QoRA approach shows better performance for delay and jitter constraints in urban scenarios for multimedia applications as compared to our earlier approach.","PeriodicalId":290227,"journal":{"name":"2016 9th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127537721","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 : 2016-07-11DOI: 10.1109/WMNC.2016.7543973
A. Martinez, K. Trichias, R. Litjens
Active Antenna Systems (AAS) technology is one of several advanced features that enable a mobile network operator to cost-efficiently increase its network capacity to cope with the exponential mobile data traffic growth and the ever more demanding performance requirements. AAS can be exploited to perform e.g. Virtual Sectorisation (ViS), i.e. using beamforming to flexibly position a virtual small cell within the service area of a macro-cell. In this paper we evaluate the performance/capacity potential of ViS in a realistic LTE (Long Term Evolution) network. We apply a planning-oriented approach for positioning virtual sectors, and develop and assess SON (Self-Organizing Networks) algorithms for the adaptive configuration of the ViS deployment. A key distinction herein is made between the cases of power sharing, where the virtual cell fully reuses the macro-cell's bandwidth and shares its transmit power; and bandwidth sharing, where the bandwidth is shared and the full transmit power is used in both cells. The results indicate that ViS offers a significant potential for performance/capacity improvement, with the highest gains observed for the case of bandwidth sharing, where it is further shown that the deployment of a SON algorithm to adapt the ViS configuration to time-varying traffic is essential to reliably achieve the potential gains.
{"title":"Performance assessment and Self-Organisation of Virtual Sectorisation in a realistic LTE network","authors":"A. Martinez, K. Trichias, R. Litjens","doi":"10.1109/WMNC.2016.7543973","DOIUrl":"https://doi.org/10.1109/WMNC.2016.7543973","url":null,"abstract":"Active Antenna Systems (AAS) technology is one of several advanced features that enable a mobile network operator to cost-efficiently increase its network capacity to cope with the exponential mobile data traffic growth and the ever more demanding performance requirements. AAS can be exploited to perform e.g. Virtual Sectorisation (ViS), i.e. using beamforming to flexibly position a virtual small cell within the service area of a macro-cell. In this paper we evaluate the performance/capacity potential of ViS in a realistic LTE (Long Term Evolution) network. We apply a planning-oriented approach for positioning virtual sectors, and develop and assess SON (Self-Organizing Networks) algorithms for the adaptive configuration of the ViS deployment. A key distinction herein is made between the cases of power sharing, where the virtual cell fully reuses the macro-cell's bandwidth and shares its transmit power; and bandwidth sharing, where the bandwidth is shared and the full transmit power is used in both cells. The results indicate that ViS offers a significant potential for performance/capacity improvement, with the highest gains observed for the case of bandwidth sharing, where it is further shown that the deployment of a SON algorithm to adapt the ViS configuration to time-varying traffic is essential to reliably achieve the potential gains.","PeriodicalId":290227,"journal":{"name":"2016 9th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125423856","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 : 2016-07-11DOI: 10.1109/WMNC.2016.7543980
H. H. Nguyen, S. Krug, J. Seitz
Measurements show that features of real-world terrains have a significant impact on the propagation characteristics of any signal. For example, hills or other features might act as obstacles limiting the communication range irregularly. This is crucial for Mobile Ad-Hoc Networks with mobile nodes and intermittent connectivity as major challenge. However, 3D real-world terrain features are usually not considered during protocol evaluation simulations. In this paper, we present our approach to integrate such features into OMNeT++/MiXiM based on publicly available Digital Elevation Model (DEM) data. We use the Durkin's propagation model to estimate the connectivity between sender and receiver in 3D-space. First simulation results clearly show the different behavior of the nodes connectivity between 2D and 3D scenarios, suggesting that this should be considered during protocol evaluations.
{"title":"Simulation of 3D signal propagation based on real world terrains for Ad-Hoc Network evaluation","authors":"H. H. Nguyen, S. Krug, J. Seitz","doi":"10.1109/WMNC.2016.7543980","DOIUrl":"https://doi.org/10.1109/WMNC.2016.7543980","url":null,"abstract":"Measurements show that features of real-world terrains have a significant impact on the propagation characteristics of any signal. For example, hills or other features might act as obstacles limiting the communication range irregularly. This is crucial for Mobile Ad-Hoc Networks with mobile nodes and intermittent connectivity as major challenge. However, 3D real-world terrain features are usually not considered during protocol evaluation simulations. In this paper, we present our approach to integrate such features into OMNeT++/MiXiM based on publicly available Digital Elevation Model (DEM) data. We use the Durkin's propagation model to estimate the connectivity between sender and receiver in 3D-space. First simulation results clearly show the different behavior of the nodes connectivity between 2D and 3D scenarios, suggesting that this should be considered during protocol evaluations.","PeriodicalId":290227,"journal":{"name":"2016 9th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121413321","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 : 2016-07-11DOI: 10.1109/WMNC.2016.7543931
Ditchaphong Phoomikiattisak, S. Bhatti
Seamless host mobility is vital to future network mobility, and has been an active research area for a long time. Much research focuses on the performance of the data plane. In this paper, we present comprehensive analyses on the control (signalling) plane in the IETF Mobile IPv6, and compare it with the IRTF Identifier-Locator Network Protocol (ILNP). The control plane behaviour is important in order to assess the robustness and scalability of the mobility protocol. ILNP has a different mobility model from Mobile IPv6: it is a host-based, end-to-end architecture and does not require additional network-layer entities. Hence, the control signals are exchanged only between the end systems. We provide model-based analyses for handoff signalling, and show that ILNP is more efficient than MIPv6 in terms of robustness and scalability. The analytical models we present could also be adapted for other mobility solutions, for comparative assessment.
{"title":"Control plane handoff analysis for IP mobility","authors":"Ditchaphong Phoomikiattisak, S. Bhatti","doi":"10.1109/WMNC.2016.7543931","DOIUrl":"https://doi.org/10.1109/WMNC.2016.7543931","url":null,"abstract":"Seamless host mobility is vital to future network mobility, and has been an active research area for a long time. Much research focuses on the performance of the data plane. In this paper, we present comprehensive analyses on the control (signalling) plane in the IETF Mobile IPv6, and compare it with the IRTF Identifier-Locator Network Protocol (ILNP). The control plane behaviour is important in order to assess the robustness and scalability of the mobility protocol. ILNP has a different mobility model from Mobile IPv6: it is a host-based, end-to-end architecture and does not require additional network-layer entities. Hence, the control signals are exchanged only between the end systems. We provide model-based analyses for handoff signalling, and show that ILNP is more efficient than MIPv6 in terms of robustness and scalability. The analytical models we present could also be adapted for other mobility solutions, for comparative assessment.","PeriodicalId":290227,"journal":{"name":"2016 9th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122401138","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 : 2016-07-11DOI: 10.1109/WMNC.2016.7543925
M. Jakob, I. Nikolaidis
In this paper we abandon the intuition that the minimum length/latency schedule of aggregation convergecast has to be constructed in an order mimicking the flow of data, i.e., from leaves to the sink. Instead we adopt a top-down construction process (from sink to the leaves), and thus forego the need to construct an aggregation tree a-priori of the (collision free) schedule construction. The resulting scheme, called MINT, is a family of heuristics whose performance is controlled by a candidate link selection strategy. We report on the best found combination of MINT and candidate link selection strategy which specifically attempts to minimize the “cost” incurred by a scheduled transmission where the cost is the number of blocked transmissions that could have occurred in the same timeslot. The results produced show a significant and systematic improvement over the state-of-the-art. We analyze the results to uncover that the improvement due to MINT hinges on the even spatial reuse of the wireless medium.
{"title":"A top-down aggregation convergecast schedule construction","authors":"M. Jakob, I. Nikolaidis","doi":"10.1109/WMNC.2016.7543925","DOIUrl":"https://doi.org/10.1109/WMNC.2016.7543925","url":null,"abstract":"In this paper we abandon the intuition that the minimum length/latency schedule of aggregation convergecast has to be constructed in an order mimicking the flow of data, i.e., from leaves to the sink. Instead we adopt a top-down construction process (from sink to the leaves), and thus forego the need to construct an aggregation tree a-priori of the (collision free) schedule construction. The resulting scheme, called MINT, is a family of heuristics whose performance is controlled by a candidate link selection strategy. We report on the best found combination of MINT and candidate link selection strategy which specifically attempts to minimize the “cost” incurred by a scheduled transmission where the cost is the number of blocked transmissions that could have occurred in the same timeslot. The results produced show a significant and systematic improvement over the state-of-the-art. We analyze the results to uncover that the improvement due to MINT hinges on the even spatial reuse of the wireless medium.","PeriodicalId":290227,"journal":{"name":"2016 9th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125018370","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
扫码关注我们
求助内容：
应助结果提醒方式：