7,460 research outputs found
Network Formation Games Among Relay Stations in Next Generation Wireless Networks
The introduction of relay station (RS) nodes is a key feature in next
generation wireless networks such as 3GPP's long term evolution advanced
(LTE-Advanced), or the forthcoming IEEE 802.16j WiMAX standard. This paper
presents, using game theory, a novel approach for the formation of the tree
architecture that connects the RSs and their serving base station in the
\emph{uplink} of the next generation wireless multi-hop systems. Unlike
existing literature which mainly focused on performance analysis, we propose a
distributed algorithm for studying the \emph{structure} and \emph{dynamics} of
the network. We formulate a network formation game among the RSs whereby each
RS aims to maximize a cross-layer utility function that takes into account the
benefit from cooperative transmission, in terms of reduced bit error rate, and
the costs in terms of the delay due to multi-hop transmission. For forming the
tree structure, a distributed myopic algorithm is devised. Using the proposed
algorithm, each RS can individually select the path that connects it to the BS
through other RSs while optimizing its utility. We show the convergence of the
algorithm into a Nash tree network, and we study how the RSs can adapt the
network's topology to environmental changes such as mobility or the deployment
of new mobile stations. Simulation results show that the proposed algorithm
presents significant gains in terms of average utility per mobile station which
is at least 17.1% better relatively to the case with no RSs and reaches up to
40.3% improvement compared to a nearest neighbor algorithm (for a network with
10 RSs). The results also show that the average number of hops does not exceed
3 even for a network with up to 25 RSs.Comment: IEEE Transactions on Communications, vol. 59, no. 9, pp. 2528-2542,
September 201
Markov Decision Processes with Applications in Wireless Sensor Networks: A Survey
Wireless sensor networks (WSNs) consist of autonomous and resource-limited
devices. The devices cooperate to monitor one or more physical phenomena within
an area of interest. WSNs operate as stochastic systems because of randomness
in the monitored environments. For long service time and low maintenance cost,
WSNs require adaptive and robust methods to address data exchange, topology
formulation, resource and power optimization, sensing coverage and object
detection, and security challenges. In these problems, sensor nodes are to make
optimized decisions from a set of accessible strategies to achieve design
goals. This survey reviews numerous applications of the Markov decision process
(MDP) framework, a powerful decision-making tool to develop adaptive algorithms
and protocols for WSNs. Furthermore, various solution methods are discussed and
compared to serve as a guide for using MDPs in WSNs
Hybrid-Vehfog: A Robust Approach for Reliable Dissemination of Critical Messages in Connected Vehicles
Vehicular Ad-hoc Networks (VANET) enable efficient communication between
vehicles with the aim of improving road safety. However, the growing number of
vehicles in dense regions and obstacle shadowing regions like Manhattan and
other downtown areas leads to frequent disconnection problems resulting in
disrupted radio wave propagation between vehicles. To address this issue and to
transmit critical messages between vehicles and drones deployed from service
vehicles to overcome road incidents and obstacles, we proposed a hybrid
technique based on fog computing called Hybrid-Vehfog to disseminate messages
in obstacle shadowing regions, and multi-hop technique to disseminate messages
in non-obstacle shadowing regions. Our proposed algorithm dynamically adapts to
changes in an environment and benefits in efficiency with robust drone
deployment capability as needed. Performance of Hybrid-Vehfog is carried out in
Network Simulator (NS-2) and Simulation of Urban Mobility (SUMO) simulators.
The results showed that Hybrid-Vehfog outperformed Cloud-assisted Message
Downlink Dissemination Scheme (CMDS), Cross-Layer Broadcast Protocol (CLBP),
PEer-to-Peer protocol for Allocated REsource (PrEPARE), Fog-Named Data
Networking (NDN) with mobility, and flooding schemes at all vehicle densities
and simulation times
Hierarchical routing protocols for wireless sensor network: a compressive survey
Wireless Sensor Networks (WSNs) are one of the key enabling technologies for the Internet of Things (IoT). WSNs play a major role in data communications in applications such as home, health care, environmental monitoring, smart grids, and transportation. WSNs are used in IoT applications and should be secured and energy efficient in order to provide highly reliable data communications. Because of the constraints of energy, memory and computational power of the WSN nodes, clustering algorithms are considered as energy efficient approaches for resource-constrained WSNs. In this paper, we present a survey of the state-of-the-art routing techniques in WSNs. We first present the most relevant previous work in routing protocols surveys then highlight our contribution. Next, we outline the background, robustness criteria, and constraints of WSNs. This is followed by a survey of different WSN routing techniques. Routing techniques are generally classified as flat, hierarchical, and location-based routing. This survey focuses on the deep analysis of WSN hierarchical routing protocols. We further classify hierarchical protocols based on their routing techniques. We carefully choose the most relevant state-of-the-art protocols in order to compare and highlight the advantages, disadvantage and performance issues of each routing technique. Finally, we conclude this survey by presenting a comprehensive survey of the recent improvements of Low-Energy Adaptive Clustering Hierarchy (LEACH) routing protocols and a comparison of the different versions presented in the literature
- …