Due to non-ideal conditions in the measurements of the wireless channel, high initial bit error rate (BER) in the preliminary key is resulted, which reduces the final secret key generation rate and even causes the secret key generation process fail. Aiming to resolve this problem, we first present and verify an optimal information reconciliation protocol; the validation experiment shows that not only the BER comes down more quickly, but also a higher information rate is achieved. Then, to address the problem of very high initial BER and further improve the efficiency of the secret key generation, we introduce the idea of pre-distillation into the secret key generation system, and present a pre-distillation method, which makes the initial BER comes down quickly, and ensures the subsequent information reconciliation be easily performed; hence the total key generation rate is improved. Experimental results demonstrate that the pre-distillation method has excellent ability of reducing the initial BER, especially in the case of very high initial BER. The combination of our proposed pre-distillation and our optimal information reconciliation is the most efficient one when the initial BER is larger than 0.15, and the information rate is improved by more than forty-nine times when the initial BER is 0.3
{"title":"Methods for Improving the Rate of Secret Key Generation based on Wireless Channel Characteristics","authors":"Qiuhua Wang, Xiaojun Wang, Q. Lv, J. Bao","doi":"10.4304/jnw.11.2.46-55","DOIUrl":"https://doi.org/10.4304/jnw.11.2.46-55","url":null,"abstract":"Due to non-ideal conditions in the measurements of the wireless channel, high initial bit error rate (BER) in the preliminary key is resulted, which reduces the final secret key generation rate and even causes the secret key generation process fail. Aiming to resolve this problem, we first present and verify an optimal information reconciliation protocol; the validation experiment shows that not only the BER comes down more quickly, but also a higher information rate is achieved. Then, to address the problem of very high initial BER and further improve the efficiency of the secret key generation, we introduce the idea of pre-distillation into the secret key generation system, and present a pre-distillation method, which makes the initial BER comes down quickly, and ensures the subsequent information reconciliation be easily performed; hence the total key generation rate is improved. Experimental results demonstrate that the pre-distillation method has excellent ability of reducing the initial BER, especially in the case of very high initial BER. The combination of our proposed pre-distillation and our optimal information reconciliation is the most efficient one when the initial BER is larger than 0.15, and the information rate is improved by more than forty-nine times when the initial BER is 0.3","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"1 1","pages":"46-55"},"PeriodicalIF":0.0,"publicationDate":"2016-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78440898","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-02-11DOI: 10.4304/jnw.10.9.501-511
Mohammed A. Al-Maqri, M. Othman, B. Ali, Z. Hanapi
The IEEE 802.11e standard introduced by IEEE 802.11 Task Group E (TGe) enhances the Quality of Service (QoS) by means of HCF Controlled Channel Access (HCCA). The scheduler of HCCA allocates Transmission Opportunitys (TXOPs) to QoS-enabled Station (QSTA) based on their TS Specifications (TSPECs) negotiated at the traffic setup time so that it is only efficient for Constant Bit Rate (CBR) applications. However, Variable Bit Rate (VBR) traffics are not efficiently supported as they exhibit non-deterministic profile during the time. In this paper, we present a dynamic TXOP assignment Scheduling Algorithm for supporting the video traffics transmission over IEEE 802.11e wireless networks. This algorithm uses a piggybacked information about the size of the subsequent video frames of the uplink traffic to assist the Hybrid Coordinator accurately assign the TXOP according to the fast changes in the VBR profile. The proposed scheduling algorithm has been evaluated using simulation with different variability level video streams. The simulation results show that the proposed algorithm reduces the delay experienced by VBR traffic streams comparable to HCCA scheduler due to the accurate assignment of the TXOP which preserve the channel time for data transmission.
{"title":"Providing Dynamic TXOP for QoS Support of Video Transmission in IEEE 802.11e WLANs","authors":"Mohammed A. Al-Maqri, M. Othman, B. Ali, Z. Hanapi","doi":"10.4304/jnw.10.9.501-511","DOIUrl":"https://doi.org/10.4304/jnw.10.9.501-511","url":null,"abstract":"The IEEE 802.11e standard introduced by IEEE 802.11 Task Group E (TGe) enhances the Quality of Service (QoS) by means of HCF Controlled Channel Access (HCCA). The scheduler of HCCA allocates Transmission Opportunitys (TXOPs) to QoS-enabled Station (QSTA) based on their TS Specifications (TSPECs) negotiated at the traffic setup time so that it is only efficient for Constant Bit Rate (CBR) applications. However, Variable Bit Rate (VBR) traffics are not efficiently supported as they exhibit non-deterministic profile during the time. In this paper, we present a dynamic TXOP assignment Scheduling Algorithm for supporting the video traffics transmission over IEEE 802.11e wireless networks. This algorithm uses a piggybacked information about the size of the subsequent video frames of the uplink traffic to assist the Hybrid Coordinator accurately assign the TXOP according to the fast changes in the VBR profile. The proposed scheduling algorithm has been evaluated using simulation with different variability level video streams. The simulation results show that the proposed algorithm reduces the delay experienced by VBR traffic streams comparable to HCCA scheduler due to the accurate assignment of the TXOP which preserve the channel time for data transmission.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"1 1","pages":"501-511"},"PeriodicalIF":0.0,"publicationDate":"2016-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89121562","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-01-28DOI: 10.4304/jnw.10.12.658-667
Min Kyung An, Hyuk Cho
In this paper, we study the Minimum Latency Collection Scheduling (MLCS) problem in Wireless Sensor Networks (WSNs) adopting the two interference models: the graph model and the more realistic physical interference model known as Signal-to-Interference-Noise-Ratio (SINR). The main issue of the MLCS problem is to compute the minimum latency schedule, that is, to compute a schedule with the minimum number of timeslots, such that all data from all nodes can be collected to a sink node without any collision or interference. First, we describe an approximation algorithm with O(1)-approximation ratio that works in both the interference models by yielding a schedule whose latency is bounded by O(n), where n is the number of nodes in the network. Then, we validate the latency performance of the proposed algorithm with various simulated networks, demonstrate the robustness of the algorithms with different network parameters, and discuss the effect of the interference models’ parameter values on the latency
{"title":"Efficient Data Collection in Interference-Aware Wireless Sensor Networks","authors":"Min Kyung An, Hyuk Cho","doi":"10.4304/jnw.10.12.658-667","DOIUrl":"https://doi.org/10.4304/jnw.10.12.658-667","url":null,"abstract":"In this paper, we study the Minimum Latency Collection Scheduling (MLCS) problem in Wireless Sensor Networks (WSNs) adopting the two interference models: the graph model and the more realistic physical interference model known as Signal-to-Interference-Noise-Ratio (SINR). The main issue of the MLCS problem is to compute the minimum latency schedule, that is, to compute a schedule with the minimum number of timeslots, such that all data from all nodes can be collected to a sink node without any collision or interference. First, we describe an approximation algorithm with O(1)-approximation ratio that works in both the interference models by yielding a schedule whose latency is bounded by O(n), where n is the number of nodes in the network. Then, we validate the latency performance of the proposed algorithm with various simulated networks, demonstrate the robustness of the algorithms with different network parameters, and discuss the effect of the interference models’ parameter values on the latency","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"38 5","pages":"658-667"},"PeriodicalIF":0.0,"publicationDate":"2016-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72600145","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-01-28DOI: 10.4304/jnw.10.11.579-586
C. Sonnenberg, J. Sonnenberg
Two seemingly unrelated trends are converging to redefine how mobile device networks are used, particularly in the emergency services and military fields where the need for instant response and anticipation of required data can affect the outcome of the participant’s survival. The first trend is the increasing ability of sophisticated mobile devices to adapt and alter their functionality in response to sensed external events, including the use of a specific device by a combatant or emergency services provider. The second trend is the continued expansion of radio capabilities as communications devices become physically smaller, yet continue to increase in computation and communications power.Yet these capabilities are constrained by the crowded spectrum environment and require more intelligent usage analysis than exists in current radio networks. In truth, both of these trends are the result of the underlying continued improvement of integrated circuits, conventionally known as Moore’s Law. However, this paper introduces how two technical disciplines (mobile device usability modeling and cognitive radio networking) can combine to provide an entirely new paradigm of mobile communications usage.
{"title":"Cognitive Network Factors as an Impact on Mobile Device Usability","authors":"C. Sonnenberg, J. Sonnenberg","doi":"10.4304/jnw.10.11.579-586","DOIUrl":"https://doi.org/10.4304/jnw.10.11.579-586","url":null,"abstract":"Two seemingly unrelated trends are converging to redefine how mobile device networks are used, particularly in the emergency services and military fields where the need for instant response and anticipation of required data can affect the outcome of the participant’s survival. The first trend is the increasing ability of sophisticated mobile devices to adapt and alter their functionality in response to sensed external events, including the use of a specific device by a combatant or emergency services provider. The second trend is the continued expansion of radio capabilities as communications devices become physically smaller, yet continue to increase in computation and communications power.Yet these capabilities are constrained by the crowded spectrum environment and require more intelligent usage analysis than exists in current radio networks. In truth, both of these trends are the result of the underlying continued improvement of integrated circuits, conventionally known as Moore’s Law. However, this paper introduces how two technical disciplines (mobile device usability modeling and cognitive radio networking) can combine to provide an entirely new paradigm of mobile communications usage.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"27 1","pages":"579-586"},"PeriodicalIF":0.0,"publicationDate":"2016-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85081469","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-01-28DOI: 10.4304/jnw.10.12.633-641
A. Gharsallah, N. Omheni, F. Zarai, M. Obaidat, K. Hsiao
The next generation wireless systems will consist of heterogeneous networks from cellular, WirelessLocal Area Networks (WLANs), Worldwide Interoperability for Microwave Access (WiMAX) to other emerging access technologies and have the capability to offer various services at any time as per user requirements, anywhere with seamless interoperability. The integration of heterogeneous wireless networks poses several challenges. One of the major challenges is vertical handoff. Handoff is the process of transferring an ongoing call or data session from one access point to another in a homogeneous or heterogeneous network. Vertical handoff occurs when a mobile terminal decides to switch between networks of diverse technologies. A key issue during vertical handoff is the selection of an optimal network that maximizes end users satisfaction. This article presents a novel approach for handover decision making in the context of heterogeneous wireless network. The aim of the proposed scheme is the selection of the most suitable radio access network for each application. The performance analysis shows that the proposed approach efficiently uses the network resources by switching between LTE and WLAN to offer best connectivity to the users.It is observed that resource utilization ratio increases to (99%) and the integration of LTE with WLAN using the proposed algorithm reduces the call dropping probability (less than 0.15 for Voice over IP service when switching to LTE network) and call blocking probability (less than 0.24)
下一代无线系统将由蜂窝、无线局域网(wlan)、微波接入全球互操作性(WiMAX)等异构网络和其他新兴接入技术组成，并具有随时随地根据用户需求提供各种服务的能力，具有无缝互操作性。异构无线网络的集成提出了几个挑战。其中一个主要的挑战是垂直交接。切换是将正在进行的呼叫或数据会话从同构或异构网络中的一个接入点转移到另一个接入点的过程。当移动终端决定在不同技术的网络之间切换时，就会发生垂直切换。垂直切换过程中的一个关键问题是选择一个最优的网络，使最终用户满意度最大化。本文提出了一种新的异构无线网络切换决策方法。所提方案的目的是为每种应用选择最合适的无线接入网。性能分析表明，该方法通过在LTE和WLAN之间的切换，有效地利用了网络资源，为用户提供了最佳的连通性。观察到，资源利用率提高到(99%)，并且使用所提出的算法将LTE与WLAN集成降低了呼叫丢失概率(切换到LTE网络时，Voice over IP业务小于0.15)和呼叫阻塞概率(小于0.24)。
{"title":"Network Selection in Heterogeneous Wireless System Environments","authors":"A. Gharsallah, N. Omheni, F. Zarai, M. Obaidat, K. Hsiao","doi":"10.4304/jnw.10.12.633-641","DOIUrl":"https://doi.org/10.4304/jnw.10.12.633-641","url":null,"abstract":"The next generation wireless systems will consist of heterogeneous networks from cellular, WirelessLocal Area Networks (WLANs), Worldwide Interoperability for Microwave Access (WiMAX) to other emerging access technologies and have the capability to offer various services at any time as per user requirements, anywhere with seamless interoperability. The integration of heterogeneous wireless networks poses several challenges. One of the major challenges is vertical handoff. Handoff is the process of transferring an ongoing call or data session from one access point to another in a homogeneous or heterogeneous network. Vertical handoff occurs when a mobile terminal decides to switch between networks of diverse technologies. A key issue during vertical handoff is the selection of an optimal network that maximizes end users satisfaction. This article presents a novel approach for handover decision making in the context of heterogeneous wireless network. The aim of the proposed scheme is the selection of the most suitable radio access network for each application. The performance analysis shows that the proposed approach efficiently uses the network resources by switching between LTE and WLAN to offer best connectivity to the users.It is observed that resource utilization ratio increases to (99%) and the integration of LTE with WLAN using the proposed algorithm reduces the call dropping probability (less than 0.15 for Voice over IP service when switching to LTE network) and call blocking probability (less than 0.24)","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"51 1","pages":"633-641"},"PeriodicalIF":0.0,"publicationDate":"2016-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72806530","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}
Wireless communications have made today’s busy world even busier. The use of hand held devices such as iPads, tablets, notebooks etc. is increasing exponentially. The wireless nature of these devices makes them flexible and opportune. However, wireless devices encounter numerous security problems compared to their wired counterpart. The lack of physical connectivity (anchor-attachment) from the wireless device to the wired network makes the wireless devices more vulnerable and hard to protect against security threats. In this view we have proposed EAP-CRA protocol to counter the security threats during the security association between a wireless device and the wired network. Our protocol leverages the advantages of Public Key Infrastructure to provide a secure connectivity to the network in a multi agent environment. As with many security protocols, in the early stages, formal verification plays a vital role, particularly when the process of implementing the protocol is time consuming. We have used Symbolic Analysis Laboratory tools to formally verify the functionality of the EAP-CRA protocol. In this paper we present a number of Linear Temporal Logic formulas that we have established to prove the integrity of our proposal. By examining all possible execution traces of the proposed protocol we have proved that our protocol is complete and consistent.
{"title":"Functional Analysis of EAP-CRA","authors":"K. Ramezani, E. Sithirasenan, Kaile Su","doi":"10.4304/jnw.11.01.28-38","DOIUrl":"https://doi.org/10.4304/jnw.11.01.28-38","url":null,"abstract":"Wireless communications have made today’s busy world even busier. The use of hand held devices such as iPads, tablets, notebooks etc. is increasing exponentially. The wireless nature of these devices makes them flexible and opportune. However, wireless devices encounter numerous security problems compared to their wired counterpart. The lack of physical connectivity (anchor-attachment) from the wireless device to the wired network makes the wireless devices more vulnerable and hard to protect against security threats. In this view we have proposed EAP-CRA protocol to counter the security threats during the security association between a wireless device and the wired network. Our protocol leverages the advantages of Public Key Infrastructure to provide a secure connectivity to the network in a multi agent environment. As with many security protocols, in the early stages, formal verification plays a vital role, particularly when the process of implementing the protocol is time consuming. We have used Symbolic Analysis Laboratory tools to formally verify the functionality of the EAP-CRA protocol. In this paper we present a number of Linear Temporal Logic formulas that we have established to prove the integrity of our proposal. By examining all possible execution traces of the proposed protocol we have proved that our protocol is complete and consistent.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"10 1","pages":"28-38"},"PeriodicalIF":0.0,"publicationDate":"2016-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82894865","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 main focus on the algorithmic theory is the network optimization. The goal of network optimization is to connect vertices of the network in an inexpensive manner. In this work we present an efficient algorithm to achieve the effective optimization for an undirected large scale graph. This work is a connectivity data structure that focuses on us to know the connectivity parameters of the existing networks and proposing algorithms to make is efficient to access the information on the network. The network is made efficient by considering the network as a graph with edge weight and edge capacity. The network thus formed makes use of the dynamic programming approach and then the routing optimization is achieved using the Hierarchical edge capacity routing algorithm (HECR). By using HECR algorithm, routing is achieved at two different levels of nodes. The proposed algorithm also addressed the load balancing in the network. It is fast for large number of nodes with 3% of less time and the route found converges to optimal
{"title":"Hybrid Edge Capacity Routing in Complex Networks","authors":"P. Ranjana, A. George","doi":"10.4304/jnw.11.01.11-15","DOIUrl":"https://doi.org/10.4304/jnw.11.01.11-15","url":null,"abstract":"The main focus on the algorithmic theory is the network optimization. The goal of network optimization is to connect vertices of the network in an inexpensive manner. In this work we present an efficient algorithm to achieve the effective optimization for an undirected large scale graph. This work is a connectivity data structure that focuses on us to know the connectivity parameters of the existing networks and proposing algorithms to make is efficient to access the information on the network. The network is made efficient by considering the network as a graph with edge weight and edge capacity. The network thus formed makes use of the dynamic programming approach and then the routing optimization is achieved using the Hierarchical edge capacity routing algorithm (HECR). By using HECR algorithm, routing is achieved at two different levels of nodes. The proposed algorithm also addressed the load balancing in the network. It is fast for large number of nodes with 3% of less time and the route found converges to optimal","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"55 1","pages":"11-15"},"PeriodicalIF":0.0,"publicationDate":"2016-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88722829","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-01-28DOI: 10.4304/jnw.10.12.627-632
B. Alkandari, K. Pahlavan
In a multi-rate data WLAN, the data rate is a function of the distance from the access point (AP). To extend the coverage of the AP to cover a target terminal outside the AP coverage area, relay nodes are deployed between the AP and the target terminal. Therefore, for a given relationship between the throughput and the distance, and a given distance between the access point and the target receiver, there is a minimum number of nodes that provides the maximum throughput to the target receiver. It is always desirable to optimize the deployment from various aspects. These aspects are application-dependent and they range from energy conservation in sensor networks to throughput and coverage maximization in data networks. This paper presents a novel approach to determine the optimal bounds for the Medium Access Control (MAC) throughput at the target receiver in a multi-hop multi-rate wireless data network. We use the principles of linear programming and a model for the physical layer (PHY) throughput-distance relationship to determine the optimal performance bounds for the MAC throughput of a target terminal as a function of distance from the AP and the number of hops. We determine the performance bounds for two scenarios. The first scenario assumes all network nodes are visible to each other. The second scenario assumes each node is only visible to it neighbors. Additionally, we determine the physical locations for the relays to reach the optimal MAC throughput for a target terminal located at a specific distance from the AP
{"title":"A Novel Approach for Performance Analysis of Multi-Rate Relay Networks","authors":"B. Alkandari, K. Pahlavan","doi":"10.4304/jnw.10.12.627-632","DOIUrl":"https://doi.org/10.4304/jnw.10.12.627-632","url":null,"abstract":"In a multi-rate data WLAN, the data rate is a function of the distance from the access point (AP). To extend the coverage of the AP to cover a target terminal outside the AP coverage area, relay nodes are deployed between the AP and the target terminal. Therefore, for a given relationship between the throughput and the distance, and a given distance between the access point and the target receiver, there is a minimum number of nodes that provides the maximum throughput to the target receiver. It is always desirable to optimize the deployment from various aspects. These aspects are application-dependent and they range from energy conservation in sensor networks to throughput and coverage maximization in data networks. This paper presents a novel approach to determine the optimal bounds for the Medium Access Control (MAC) throughput at the target receiver in a multi-hop multi-rate wireless data network. We use the principles of linear programming and a model for the physical layer (PHY) throughput-distance relationship to determine the optimal performance bounds for the MAC throughput of a target terminal as a function of distance from the AP and the number of hops. We determine the performance bounds for two scenarios. The first scenario assumes all network nodes are visible to each other. The second scenario assumes each node is only visible to it neighbors. Additionally, we determine the physical locations for the relays to reach the optimal MAC throughput for a target terminal located at a specific distance from the AP","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"27 1","pages":"627-632"},"PeriodicalIF":0.0,"publicationDate":"2016-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86976158","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-01-28DOI: 10.4304/jnw.10.12.642-657
S. K. Dhurandher, D. Sharma, Sahil Gupta, I. Woungang, M. Obaidat
In an Opportunistic networks (OppNets), an established end-to-end connected route between the source anddestination nodes may never exist, making the routing of messages achallenge. However, using some infrastructures, it is possible to create an OppNet architecture similar to that of a well-connected network. This paper focuses on combining the benefits of infostation and message ferry to design a novelrouting schemecalled Horizontal and Vertical ferry (HVF), which also includes an acknowledgment method for message delivery that has not been considered in any of the existing approaches that uses infostation or message ferry. Through simulations, the performance of the proposed HVF scheme is evaluated and compared against that ofthe Global Ferry scheme (GFS), chosen as benchmark,in terms of number of messages delivered, overhead ratio, average latency, and average buffer time, showing that HVFoutperforms the GFS in both the normaland ferry failure scenarios
{"title":"Integration of Fixed and Mobile Infrastructure for Message Passing in Opportunistic Networks","authors":"S. K. Dhurandher, D. Sharma, Sahil Gupta, I. Woungang, M. Obaidat","doi":"10.4304/jnw.10.12.642-657","DOIUrl":"https://doi.org/10.4304/jnw.10.12.642-657","url":null,"abstract":"In an Opportunistic networks (OppNets), an established end-to-end connected route between the source anddestination nodes may never exist, making the routing of messages achallenge. However, using some infrastructures, it is possible to create an OppNet architecture similar to that of a well-connected network. This paper focuses on combining the benefits of infostation and message ferry to design a novelrouting schemecalled Horizontal and Vertical ferry (HVF), which also includes an acknowledgment method for message delivery that has not been considered in any of the existing approaches that uses infostation or message ferry. Through simulations, the performance of the proposed HVF scheme is evaluated and compared against that ofthe Global Ferry scheme (GFS), chosen as benchmark,in terms of number of messages delivered, overhead ratio, average latency, and average buffer time, showing that HVFoutperforms the GFS in both the normaland ferry failure scenarios","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"199 1","pages":"642-657"},"PeriodicalIF":0.0,"publicationDate":"2016-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82811785","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-01-28DOI: 10.4304/jnw.10.11.597-605
M. Hasan, A. F. Ismail, A. Hashim, S. Islam, W. Hashim
The arbitrary deployment of HeNodeBs high-lights the importance of interference minimization in order to capture the best. Timing as well as synchronization are equally essential for control of HeNodeBs in 4G LTE devices. So as to sustain HeNodeBs for management, IEEE1588 master slave strategies are being used in order to maintain HeNodeBs for the control purpose. Nonetheless, as a result of poor internet connectivity for a long period HeNodeBs undergoes synchronization problems that leads to clock offset problem. Asymmetric link delays, due to phase and frequency misalignment causes the effects on interference and system QoS. Moreover, to mitigate interference and for QoS synchronization is prerequisite for heterogeneous network. This paper inspects the pros and cons of the IEEE 1588 algorithm and IEEE Precision Timing Protocol (PTP). Therefore, this paper proposed a hybrid phase and frequency synchronization scheme. Comparing to IEEE1588 and PTP, hybrid scheme can improve the clock Phase (offset), and frequency error in two-tier Heterogeneous Network. The proposed scheme is evaluated by Monte Carlo system level simulation, and the results are benchmarked with the existing techniques. The simulation outcome ensures that the hybrid time synchronization strategy is much better in Heterogeneous network with regards to phase (offset) and frequency errors
{"title":"Design and Development of Hybrid Time Synchronization Scheme to Mitigate the Phase and Frequency error for Asynchronous Link in Heterogeneous Network","authors":"M. Hasan, A. F. Ismail, A. Hashim, S. Islam, W. Hashim","doi":"10.4304/jnw.10.11.597-605","DOIUrl":"https://doi.org/10.4304/jnw.10.11.597-605","url":null,"abstract":"The arbitrary deployment of HeNodeBs high-lights the importance of interference minimization in order to capture the best. Timing as well as synchronization are equally essential for control of HeNodeBs in 4G LTE devices. So as to sustain HeNodeBs for management, IEEE1588 master slave strategies are being used in order to maintain HeNodeBs for the control purpose. Nonetheless, as a result of poor internet connectivity for a long period HeNodeBs undergoes synchronization problems that leads to clock offset problem. Asymmetric link delays, due to phase and frequency misalignment causes the effects on interference and system QoS. Moreover, to mitigate interference and for QoS synchronization is prerequisite for heterogeneous network. This paper inspects the pros and cons of the IEEE 1588 algorithm and IEEE Precision Timing Protocol (PTP). Therefore, this paper proposed a hybrid phase and frequency synchronization scheme. Comparing to IEEE1588 and PTP, hybrid scheme can improve the clock Phase (offset), and frequency error in two-tier Heterogeneous Network. The proposed scheme is evaluated by Monte Carlo system level simulation, and the results are benchmarked with the existing techniques. The simulation outcome ensures that the hybrid time synchronization strategy is much better in Heterogeneous network with regards to phase (offset) and frequency errors","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"8 1","pages":"597-605"},"PeriodicalIF":0.0,"publicationDate":"2016-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87877105","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
扫码关注我们
求助内容：
应助结果提醒方式：