scholarly journals An overlay and distributed approach to node mobility in multi-access wireless networks

2013 ◽  
Vol 20 (6) ◽  
pp. 1275-1293 ◽  
Author(s):  
Paolo Dini ◽  
Jaume Nin Guerrero ◽  
Nicola Baldo
2014 ◽  
Vol 926-930 ◽  
pp. 1947-1952
Author(s):  
Ming Kun Wang ◽  
Wei Zhang

The design of TCP/IP is the key of the success of Internet. Due to the network considered as a “black box”, the congestion control algorithm becomes the most important part of TCP. TCP Westwood provides an eligible rate estimation algorithm that improves upon the performance of TCP Reno in wired as well as wireless networks. The improvement is most significant in wireless networks with lossy links. In mobile communication, due to the node mobility, the bandwidth shifting requires higher demands to QoS. In mobile networks with high bandwidth, such as 3G/LTE, the bandwidth will shift rapidly in different positions. We call this bandwidth instability, which is the cause of the degradation of performance. However, Westwood TCP or the other popular TCP cannot response quickly to this situation. In this paper, we verify the problem mentioned above of varied TCP protocols. After that, we propose an improved fast recovery mechanism based on Westwood TCP. The new mechanism can adjust the congestion window in time when the bandwidth shifts.


2010 ◽  
pp. 1473-1487
Author(s):  
Qunwei Zheng ◽  
Xiaoyan Hong ◽  
Jun Liu ◽  
Lei Tang

A multi-hop wireless network with highly dynamic members and mobility is vulnerable to many attacks. To address this problem, we propose a novel time-based approach that exploits mobility. In our scheme, the source sends shares at different times. Due to node mobility, these shares will be routed through different intermediate nodes. It is highly unlikely that a particular intermediate node is able to be on many of these routes and to collect enough shares to reconstruct the original message. The scheme is particularly suitable for applications that can tolerate long message delays, as studied in Delay Tolerant Networks. The article focuses on analyzing the feasibility of this scheme. We describe a general approach to calculate the probability of intercepting enough shares by arbitrary nodes, together with simulations. The results show that the probability is small. The scheme provides a valuable alternative for delay tolerant applications to enhance message confidentiality.


Author(s):  
Sattar B. Sadkhan ◽  
Nidaa A. Abbas

Wireless networks are inherently more vulnerable than their wired counterparts. In addition, complications arise in the presence of node mobility and dynamic network topology. Moreover, intermittent connectivity, whether caused by mobility or periodic node sleep, brings about additional challenges. At the same time, node resource constraints make direct adoption of existing security solutions difficult, if not impossible. Wireless Communication Network Security and Privacy analyze important problems in the realms of wireless networks and mobile computing. The Security aspects relate to authentication, access control and authorization, nonrepudation, privacy and confidentiality, integrity, and auditing. Privacy is an essential feature of any product or service.


Author(s):  
Ju Wang ◽  
Jonathan Liu

Efficient channel allocation is the key to fully exploit the signal diversity presented in the multi-carrier physical link in today's broadband wireless access networks. There are mounting evidences that the 4G and future-generation systems will take advantage of two opposite types of access methods, one using centralized control method and the other using a distributed approach. The authors study the distributed channel allocation problem in this article, formulated as a non-linear optimization problem, in broadband wireless networks. The signal properties of the multi-carrier radio interface in 3G and 4G networks are discussed to comprehend the complexity of the channel allocation problem. The authors propose a novel distributed heuristic algorithm based on the particle-swarm searching method. The distributed approach allows user stations to quickly switch sub-carriers with minimum intervention from the base station. The work presented in this paper shows an effective method to allocate a large number of channels while minimizing the possible interference. Extensive numerical experiments are conducted to evaluate several versions of distributed channel allocation algorithm for these new problem settings. The authors' results show that PSO-based method converges quickly in all our numerical experiments despite the high-dimensional searching space. The proposed technologies will eventually allow the true mobile steaming video/audio experience anywhere and anytime, which will have the huge impact to business, entertainment and people's quality of life.


Sign in / Sign up

Export Citation Format

Share Document