Adaptive and reliable video transmission over UMTS for enhanced performance

This paper proposes a mechanism for the congestion control for video transmission over universal mobile telecommunications system (UMTS). Our scheme is applied when the mobile user experiences real‐time multimedia content and adopts the theory of a widely accepted rate control method in wired networks, namely equation‐based rate control. In this approach, the transmission rate of the multimedia data is determined as a function of the packet loss rate, the round trip time and the packet size and the server explicitly adjusts its sending rate as a function of these parameters. Furthermore, we examine the performance of the UMTS for real‐time video transmission using real‐time protocols. Through a number of experiments, we measure performance parameters such as end‐to‐end delay, delay in radio access network, delay jitter and throughput in the wireless link. Copyright © 2006 John Wiley & Sons, Ltd.     

Routing protocol development for quality of service optimization of video‐on‐demand system over mobile ad hoc networks

A video‐on‐demand (VoD) application system over mobile ad hoc networks typically requires particular quality of service (QoS) parameters to be achieved. In this paper, we have proposed a novel QoS‐based routing protocol called as mobile VoD protocol. This protocol has been developed for improving the QoS of the mobile VoD system (normal Mobi_VoD approach). The protocol uses customer caching scheme for storing the first fragment of the entire video in the mobile customers and thereafter broadcast them when the new mobile customers missed the portion of the already transmitted first fragment for reducing the service delay of the customer, consequently optimizing QoS parameters. Various scenarios have been studied, and the efficacy of simulation results proves that the proposed system architecture in which the mobile customers use an ad hoc network caching scheme (mobile VoD protocol) is more efficient and performs better than the existing system (ad hoc on‐demand distance vector protocol) when compared in terms of QoS parameters such as the end‐to‐end delay, energy consumption, packet delivery ratio, throughput, and overhead.     

Modeling epidemic data diffusion for wireless mobile networks

Data/content dissemination among the mobile devices is the fundamental building block for all the applications in wireless mobile collaborative computing, known as mobile peer‐to‐peer. Different parameters such as node density, scheduling among neighboring nodes, mobility pattern, and node speed have a tremendous impact on data diffusion in a mobile peer‐to‐peer environment. In this paper, we develop analytical models for object diffusion time/delay in a wireless mobile network to apprehend the complex interrelationship among these different parameters. In the analysis, we calculate the probabilities of transmitting a single object from one node to multiple nodes using the epidemic model of spread of disease. We also incorporate the impact of node mobility, radio range, and node density in the networks into the analysis. Utilizing these transition probabilities, we estimate the expected delay for diffusing an object to the entire network both for single object and multiple object scenarios. We then calculate the transmission probabilities of multiple objects among the nodes in the wireless mobile network considering network dynamics. Through extensive simulations, we demonstrate that the proposed scheme is efficient for data diffusion in the wireless mobile network. Copyright © 2012 John Wiley & Sons, Ltd.     

Enhanced fuzzy logic‐based spray and wait routing protocol for delay tolerant networks

Delay tolerant networks are a class of ad hoc networks that enable data delivery even in the absence of end‐to‐end connectivity between nodes, which is the basic assumption for routing in ad hoc networks. Nodes in these networks work on store‐carry and forward paradigm. In addition, such networks make use of message replication as a strategy to increase the possibility of messages reaching their destination. As contact opportunities are usually of short duration, it is important to prioritize scheduling of messages. Message replication may also lead to buffer congestion. Hence, buffer management is an important issue that greatly affects the performance of routing protocols in delay tolerant networks. In this paper, Spray and Wait routing protocol, which is a popular controlled replication‐based protocol for delay tolerant networks, has been enhanced using a new fuzzy‐based buffer management strategy Enhanced Fuzzy Spray and Wait Routing, with the aim to achieve increased delivery ratio and reduced overhead ratio. It aggregates three important message properties namely number of replicas of a message, its size, and remaining time‐to‐live, using fuzzy logic to determine the message priority, which denotes its importance with respect to other messages stored in a node's buffer. It then intelligently selects messages to schedule when a contact opportunity occurs. Because determination of number of replicas of a message in the network is a difficult task, a new method for estimation of the same has been proposed. Simulation results show improved performance of enhanced fuzzy spray and wait routing in terms of delivery ratio and resource consumption. Copyright © 2014 John Wiley & Sons, Ltd.     

异构网络中基于移动社交组网的内容传播研究

Since more and more mobile applications are based on the proliferation of social information, the study of Mobile Social Net-works (MSNs) combines social sciences and wireless communications. Operating wireless networks more efficiently by exploiting social relationships between MSN users is an ap-pealing but challenging option for network operators. An MSN-aided content dissemina-tion technique is presented as a potential ex-tension of conventional cellular wireless net-works in order to satisfy growing data traffic. By allowing the MSN users to create a self-organized ad hoc network for spontane-ously disseminating contents, the network operator may be able to reduce the oper-ational costs and simultaneously achieve an improved network performance. In this paper, we first summarize the basic features of the MSN architecture, followed by a survey of the factors which may affect MSN-aided content dissemination. Using a case study, we demon-strate that one can save resources of the Base Station (BS) while substantially lowering content dissemination delay. Finally, other potential applications of MSN-aided content dissemination are introduced, and a range of future challenges are summarized.     

Improved video streaming using MSVC and nonoverlapping zone routing multipath propagation over MANETs

Providing real‐time video streaming in mobile ad hoc networks is difficult because of the time‐dependent channel status and stringent service requirements. The currently existing route request‐reply–based multihop overlay networks cause considerable control overheads in video transmission resulting in loss of data and communication breakdown. Such networks are more suitable to nonstreaming video applications rather than to time‐sensitive video streaming applications. Therefore, a powerful mechanism needs to be adopted to handle the channel failures amicably and reduce latency effectively in time critical video streaming applications over mobile ad hoc networks. In order to be resilient to the channel failures and reduce latency in such applications, 2 strategies, namely, multistate video coding and 2‐tier–based nonoverlapping zone routing multipath propagation through directional antennas have respectively been incorporated. The performance of the proposed nonoverlapping zone routing multipath propagation system is compared with those of the existing multicast zone routing and zone‐based hierarchical link state routing protocols with parameters average end‐to‐end delay, routing overhead and packet delivery ratio using NS 2.34. The simulation results show that latency and resilience get considerably improved. Finally, the video quality of the proposed work has been verified by subjective and objective video testing methods.     

An energy-aware deadline-constrained message delivery in delay-tolerant networks

In order to understand the message dissemination performance in delay-tolerant networks, much analysis work has been proposed in literature. However, existing work shares a common simplification that the pairwise inter-meeting time between any two mobile nodes is exponentially distributed. Not mention the fact that such assumption is only an approximation, it cannot be applied by network planners to directly control the mobile nodes for any network optimization, e.g., energy efficiency. It is quite significant to study the relationship between the network performance with the parameters that can be adjusted directly to tackle the limitations of current exponential distribution assumption based analysis. Therefore, in this paper, we are motivated to jointly consider the transmission range and messages residence time to stochastically analyze deadline-constrained message delivery ratio utilizing a controlled epidemic routing. The message propagation is considered as an age-structure process and described by a susceptible–infectious–recovered model, which is then analyzed using delay differential equations. Since both the transmission range and the message residence time are related to the mobile nodes’ energy consumption, we further apply our analysis framework to investigate the tradeoff between the energy consumption and the achievable message delivery ratio. The correctness and accuracy of our analysis are validated by extensive simulations.     

Seamless session mobility scheme in heterogeneous wireless networks

The next generation wireless communication system will likely be heterogeneous networks, as various technologies can be integrated on heterogeneous networks. A mobile multiple‐mode device can easily access the Internet through different wireless interfaces. The mobile multiple‐mode device thus could switch to different access points to maintain the robustness of the connection when it can acquire more resources from other heterogeneous wireless networks. The mobile multiple‐mode device therefore needs to face the handover problem in such environment. This work introduces Session Initiation Protocol (SIP)‐based cross‐layer scheme to support seamless handover scheme over heterogeneous networks. The proposed scheme consists of a battery lifetime‐based handover policy and cross‐layer fast handover scheme, called the SIP‐based mobile stream control transmission protocol (SmSCTP). This work describes the major idea of the proposed scheme and infrastructure. The proposed scheme has been implemented in Linux system. The simulation and numerical results demonstrate that the proposed SmSCTP scheme yields better signaling cost, hand‐off delay time, packet loss and delay jitter than SIP and mSCTP protocols. Copyright © 2010 John Wiley & Sons, Ltd.     

Modified Light Weight distributed QoS Algorithm for wide area ad hoc networks

The direction and velocity of a node are the most important parameters to create a valuable path in ad hoc networks. A valuable path is one that has a longer life time and more durability than others. As we know, the durability of a path is under the influence of the nodes' velocity. This paper proposes an algorithm to provide QoS in ad hoc networks. The proposed algorithm entitled Modified Light Weight distributed QoS Algorithm, considering the direction and relative velocity of the nodes and predicting the value of link durability, chooses a path with longer duration time, minimizes the link breaks, and improves QoSs. We implemented it in a simulation environment by using the Network Simulator Version 2 software and evaluated the effectiveness of it in packet delivery ratio, packet delivery latency, average end‐to‐end delay, routing overhead, and dropped packets. The simulation results demonstrate that Modified Light Weight distributed QoS Algorithm improves the QoS parameters in ad hoc networks.     

Empirical evaluation of receiver‐based TCP delay control in CDMA2000 networks

Wide‐area broadband wireless technologies such as CDMA2000 often suffer from variable transfer rate and long latency. In particular, TCP window‐based rate control causes excessive buffering at the base station because of the lower transfer rate of the wireless link than that of the wired backhaul link. This performance characteristic of TCP further increases the end‐to‐end delay, and additional resources are required at the base station. This paper presents a practical mechanism to control the end‐to‐end TCP delay for CDMA2000 networks (or other similar wireless technologies). The key idea is to reduce and stabilize RTT (round‐trip time) by dynamically controlling the TCP advertised window size, based on a runtime measurement of the wireless channel condition at the mobile station. The proposed system has been implemented by modifying the Linux protocol stack. The experiment results, conducted on a commercial CDMA2000 1x network, show that the proposed scheme greatly reduces the TCP delay in non‐congested networks, while not sacrificing the TCP throughput in congested networks. Copyright © 2006 John Wiley & Sons, Ltd.     

Improved multicast routing in MANETs using link stability and route stability

The growing popularity of multimedia applications and services needs to support several quality of service metrics such as high throughput, low energy, and jitter, which is a challenging task in mobile ad hoc networks. Because of limited bandwidth, energy constraints, dynamic topology, transmission errors, and fluctuating link stability, the links between adjacent nodes are often not reliable and may break because of node mobility. Link breakage initiates the process of rerouting either at the sender node (the node at which the link breaks) or at the source node. In either case, it leads to packet loss, delivery delays, and increased control overheads. Hence, to attain a minimum quality of service, routing protocols must address the dynamic network topology. Uncertain and varying movement of nodes necessitates stability of the links between such nodes. The objective of this paper is to propose 2 protocols, the first based on link stability and the other based on route stability. Link stability identifies a stable link from the available links to the next hop and determines a stable end‐to‐end route. The probability of successful transmission of periodic packets is used as a link stability metric to assess the stable path. Acknowledgment ‐free packets are used to check connectivity in the network. Increased probability of successful transmission implies that the selected link is sustained for longer duration and can deliver packets more reliably or, as a consequence, results in a stable link to deliver a better data rate. With a stable link, there is a reduced possibility of retransmissions, reduced end‐to‐end delay, reduced control overheads, and enhanced data delivery ratio. Selection of the most stable route for data transmission improves the performance. Experimental results from simulations performed on EXata/Cyber v2.0 simulator reveal that our proposed protocols are an improvement over the existing protocols in terms of packet delivery ratio, average end‐to‐end delay, and average route lifetime, even without route optimization with the minor increase in control packets. A case study of the application of proposed protocols is also presented.     

Analysing social behaviour and message dissemination in human based delay tolerant network

Recent advances in mobile communication shows proliferation in networks formed by human carried devices known as the pocket switched network (PSN). Human beings are social animals. They tend to form groups and communities, and have repetitive mobility pattern which can be used to disseminate information in PSNs. In this paper, we give a deeper insight to the nature of community formation and how such information can be used to help opportunistic forwarding in mobile opportunistic networks. Using real world mobility traces, we first derive the adjacency list for each node and form the contact graph. Using tools from social network analysis we then determine various node properties like centrality and clustering coefficient and graph properties like average path length and modularity. Based on the derived graph properties, node encounter process and nature of message dissemination in PSNs, we propose two social based routing, known as the contact based routing and community aware two-hop routing. We compare the proposed routing techniques with generic epidemic and prophet routing and Bubble-Rap, a social based routing. Results show that the proposed algorithms is able to achieve better delivery ratio and lower delay than Bubble Rap, while reducing the high overhead ratio of epidemic and prophet routing.     

Performance modeling and optimization of multiple‐objective cross‐layer design in multi‐flow ad‐hoc networks

In ad‐hoc wireless networks, to achieve good performance, multiple parameters need to be optimized jointly. However, existing literature lacks a design framework that investigates the synchronic impact of several parameters on overall system performance. Among several design parameters, energy conservation, end‐to‐end delay minimization, and improved throughput are considered most important for efficient operation of these networks. In this paper, we propose a novel scheme for multiple‐objective cross‐layer optimization capable of optimizing all these performance objectives simultaneously for reliable, energy‐efficient, and timely transmission of continuous media information across the network. The three global criteria considered for optimization are incorporated in a single programming problem via linear scalarization. Besides, we employ standard convex optimization method and Lagrangian technique to solve the proposed problem to seek optimality. Extensive simulation results are generated accounting for several topologies with multiple concurrent flows in the network. These results are used to validate the analytical results and demonstrate the efficiency of the proposed optimization model. Efficiency of the model is verified by finding the set of Pareto‐optimal solutions plotted in three‐dimensional objective space. These solution points constituting the Pareto front are used as the best possible balance points among maximum throughput, maximum residual energy, and least network delay. Finally, to emphasize the effectiveness and supremacy of our proposed multiple‐objective cross‐layer design scheme, we compare it with the conventional multiple‐objective genetic algorithm. Simulation results demonstrate that our method provides significant performance gain over the genetic algorithm approach in terms of the above specified three objectives.     

mWSN for Large Scale Mobile Sensing

This paper reviews the state-of-the-art features introduced by sink mobility into wireless sensor networks (WSN), and introduces the architecture of mobile enabled Wireless Sensor Network (mWSN) to realize large-scale information gathering via networked wireless sensors and mobile sinks. After introducing the mobile sensing scenarios, some fundamental design parameters in mWSN have been investigated, such as cluster size, sink velocity, transmission range, and packet length. Our contributions include: (1) A cluster formation method has been proposed via multihop forwarding to form a cluster around the expected position of a mobile sink, in order to guarantee packet delay and minimize energy consumption. (2) Analysis of the performance influence by sink mobility leads to the conclusion that the optimal sink velocity must make a compromise between sink-sensor meeting delay and message delivery delay. (3) Finding that large transmission range and short packet length are both of benefit to lower the outage probability of packet transmission. Extensive simulations have been designed to evaluate the performance of mWSN in terms of packet delay, energy consumption and outage probability of packet transmission.

On minimizing the system information age in vehicular ad-hoc networks via efficient scheduling and piggybacking

Recent advances in vehicular networks have enforced researchers to focus on various information dissemination techniques. Exchanging information among the vehicles is imperative due to the ever-changing network topology in vehicular networks. However, random transmitter selection in traditional CSMA based channel access mechanism limits the delay performance. Data, such as state information, is often time critical, and hence, efficient information dissemination techniques to improve delay performance are essential. In this work, we aim to minimize the average system age which is the mean number of time slots old a vehicle’s information is at all other vehicles in the network. To achieve this, we explore the benefits of simultaneous transmission along with piggybacking of information for multi-hop communication. While allowing simultaneous transmission guarantees faster dissemination of information, piggybacking facilitates dissemination of more information per transmission, thereby keeping the network more updated. We have also analysed the relationship between piggybacked information and number of vehicles in the network. Simulation results show improvement in network performance. Our analytical results are in good agreement with the simulation results.     

Joint optimization and threshold structure dynamic programming with enhanced priority scheme for adaptive VANET MAC

Nodes in vehicular ad-hoc network (VANET) are highly mobile, traversing in unpredictable and varying environment. Therefore, contention window size and transmission power should adapt according to the high mobility transmission environment. In this paper, we propose an adaptive VANET medium access control (MAC) layer with joint optimization for VANET (MACVS) which aims at minimizing average delay and maximizing packet success rate. An adaptive joint optimization with proposed threshold structure dynamic programming, with closed loop feedback control system, is designed to optimize contention window size and transmission power. Adaptive optimization is done based on road traffic conditions and transmission reliable distance range (depicted by interference and noise), by monitoring the continuous change and threshold of received signal strength to interference and noise ratio. Mathematical expressions have been developed for the MACVS optimization framework, and the produced analytical results show good agreement with the simulation results. Simulations with different arrival rates and urban map of city center show that the proposed MACVS with low complexity joint optimization effectively reduces end-to-end delay while achieving high packet success rate under various network traffic condition.     

Performance study of a wireless mobile ad hoc network with orientation‐dependent internode communication scheme

A Petri‐net‐based simulation model of a wireless mobile ad hoc network is developed and studied. The model covers all the fundamental aspects of behaviour of such a network and uses a novel scheme of orientation‐dependent (or sector‐dependent) internode communication, with random states of links. The proposed scheme enables representation of reliability aspects of wireless communication, such as fading effects, interferences, presence of obstacles and weather conditions in a general and rather easy way. The simulation model was implemented in terms of a class of extended Petri nets to explicitly represent parallelism of events and processes in the WLAN as a distributed system. In the simulation, the behaviour of four fundamental performance metrics — packet delivery ratio, average number of hops, relative network traffic and end‐to‐end delay — were investigated with varying distance of transmission and different combinations of model parameters. Copyright © 2012 John Wiley & Sons, Ltd.     

Considerations for application‐layer multipath transport control

Multipath transport faces a lot of challenges caused by path diversity, network dynamics, and service diversity. An effective end‐to‐end multipath transport control mechanism becomes essential to efficiently utilize multiple paths. On the base of the general framework of multipath transport system based on application‐level relay proposed in our previous work, this paper presents a multipath transport control mechanism supporting various applications with different transmission requirements. We propose a multipath transport protocol suite, which is extensible and suitable for various applications, and a multipath transport control model in which an application‐dependent splitting granularity named flow block is introduced. Two load distribution models are explored: the earliest idle path first load distribution for reliable data transmission to maximize the data throughput and the packet reordering‐controlled load distribution for real‐time data transmission to minimize the packet reordering thereby reducing end‐to‐end delay and packet loss rate of multipath transport. Simulation results show that the proposed models can effectively improve data throughput for applications with reliable transmission requirements and reduce the total packet loss rate of the destination for applications with real‐time transmission requirements.     

QoS‐based radio network dimensioning for LTE networks with heavy real‐time traffic

Applications of video streaming and real‐time gaming, which generate large amounts of real‐time traffic in the network, are expected to gain considerable popularity in Long Term Evolution networks. Maintaining the QoS such as packet delay, packet loss ratio, median, and cell border throughput requirements in networks dominated by real time traffic, is critical. The existing dimensioning methodology does not consider QoS parameters of real‐time traffic in network dimensioning. Moreover, exhaustive and time‐consuming simulations are normally required to evaluate the performance and QoS of real‐time services. To overcome this problem, we propose an improved radio network dimensioning framework that considers the QoS of real‐time traffic in network dimensioning. In this framework, an analytical model is proposed to evaluate the capacity and performance of real‐time traffic dominant Long Term Evolution networks. The proposed framework provides a fast and accurate means of finding the trade‐off between system load, packet delay, packet loss ratio, required median, and cell border throughput. It also provides network operators with an analytical means for obtaining the minimum number of sites required by jointly considering coverage, capacity and QoS requirements. The accuracy of the proposed model is validated through simulations. Copyright © 2012 John Wiley & Sons, Ltd.