A Cooperative Routing Algorithm to Increase QoS in Wireless E-Healthcare Systems

2013 ◽  
pp. 375-387 ◽  
Author(s):  
Sabato Manfredi
Keyword(s):  
Wireless Network ◽  
Network Performance ◽  
Ad Hoc ◽  
Networked Control Systems ◽  
Routing Algorithm ◽  
Future Generation ◽  
Healthcare Systems ◽  
Ad Hoc Routing ◽  
Cooperative Routing ◽  
Systems Architectures

The recent increased interest in distributed and flexible wireless pervasive applications has drawn great attention to WNCS (Wireless Networked Control Systems) architectures based on WSANs (Wireless Sensor and Actuator Networks) and the resulting Quality of Service obtained in specific applications. Particularly, in wireless E-Healthcare systems based on WSANs, providing certain QoS specifications is crucial for the actuators as they perform actions based on the vital data received from sensors. This chapter is concerned with the performance evaluation of a cooperative routing algorithm QBAR (Queue Based Ad hoc Routing algorithm) for wireless E-Healthcare systems. Simulations have been carried out in order to quantify the impact of the proposed algorithm on the overall network performance, and a comparison with the existing AODV algorithm is presented. The algorithm performances are validated by the Matlab/Simulink-based simulator, TrueTime, which facilitates the co-simulation of controller task execution in real-time kernels and in a wireless network environment. The simulation results highlight that “cooperation” strategies between wireless healthcare devices can strongly improve the reliability of the wireless network, and hence, they are suitable and rewarding for the management of the future generation of E-Healthcare systems.

scholarly journals Swarm-Intelligence-Centric Routing Algorithm for Wireless Sensor Networks

Sensors ◽  
2020 ◽  
Vol 20 (18) ◽  
pp. 5164
Author(s):  
Changsun Shin ◽  
Meonghun Lee
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Swarm Intelligence ◽  
Network Performance ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Optimal Solution ◽  
Link Quality ◽  
Wireless Sensor ◽  
Control Message

The swarm intelligence (SI)-based bio-inspired algorithm demonstrates features of heterogeneous individual agents, such as stability, scalability, and adaptability, in distributed and autonomous environments. The said algorithm will be applied to the communication network environment to overcome the limitations of wireless sensor networks (WSNs). Herein, the swarm-intelligence-centric routing algorithm (SICROA) is presented for use in WSNs that aim to leverage the advantages of the ant colony optimization (ACO) algorithm. The proposed routing protocol addresses the problems of the ad hoc on-demand distance vector (AODV) and improves routing performance via collision avoidance, link-quality prediction, and maintenance methods. The proposed method was found to improve network performance by replacing the periodic “Hello” message with an interrupt that facilitates the prediction and detection of link disconnections. Consequently, the overall network performance can be further improved by prescribing appropriate procedures for processing each control message. Therefore, it is inferred that the proposed SI-based approach provides an optimal solution to problems encountered in a complex environment, while operating in a distributed manner and adhering to simple rules of behavior.

Analysis of Existing Trust Based Routing Schemes Used in Wireless Network

2016 ◽  
Vol 10 (2) ◽  
pp. 26-40 ◽  
Author(s):  
Kajal S. Patel ◽  
Jagdish S. Shah
Keyword(s):  
Wireless Network ◽  
Network Performance ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Battery Life ◽  
Delayed Response ◽  
Error Message ◽  
Trust Value ◽  
Network Nodes ◽  
Routing Schemes

Wireless networks are vulnerable to many security attacks as they use wireless media and a node has to depend on unknown intermediate nodes for data transmission. Cryptographic algorithms used for wired network cannot work efficiently in wireless network, as in wireless network nodes are mobile and battery operated. Nodes may also have limited resources available. So, to detect malicious activities on node and improve stability of route while routing in mobile ad hoc network, trust-based routing is used. Communication parameters used in calculating trust value in most of existing trust based protocol (wireless network) are number of successful session or packet forwarded between two nodes, number of packet dropped or delayed, response time, battery life, mobility of node etc. This paper provides analysis of existing trust based routing by surveying current “sate of the art” work in this area. This paper also proposed a new parameter (number of route error message sent by a node) of a wireless node which can affect the network performance and can be used to calculate trust value.

A new Ad Hoc routing algorithm based on minimizing the channel handoff

2010 ◽  
Vol 27 (6) ◽  
pp. 749-755
Author(s):  
Jin Xie ◽  
Qi Zhu ◽  
Zongshou Li
Keyword(s):  
Ad Hoc ◽  
Routing Algorithm ◽  
Ad Hoc Routing

scholarly journals An Improvement in Stability of MANET using Flow Admission Control Algorithm

2011 ◽  
pp. 142-149
Author(s):  
Mohit Ranjan Panda ◽  
Manas Ranjan Mishra
Keyword(s):  
Wireless Network ◽  
Admission Control ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Throughput Capacity ◽  
Time Data ◽  
Network Systems ◽  
Ad Hoc Wireless Network ◽  
Mobile Ad Hoc ◽  
Stable Throughput

An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any centralized administration or standard support services. However flows transported across mobile ad hoc wireless networks suffer from route breakups caused by nodal mobility. In a network that aims to support critical interactive real-time data transactions, to provide for the uninterrupted execution of a transaction, or for the rapid transport of a high value file, it is essential to identify stable routes across which such transactions are transported. Noting that route failures can induce long re-routing delays that may be highly interruptive for many applications and message/stream transactions, it is beneficial to configure the routing scheme to send a flow across a route whose lifetime is longer, with sufficiently high probability, than the estimated duration of the activity that it is selected to carry. We evaluate the ability of a mobile ad hoc wireless network to distribute flows across routes which is sufficiently stable for successful transmission. As a special case, for certain applications only transactions that are completed without being prematurely interrupted may convey data to their intended users that is of acceptable utility. We describe the mathematical calculation of a network’s stable throughput measure, as well as its stable throughput capacity. We proposed the stable throughput and flow admission control routing algorithm (SFAR) to provide for the timely and stable transport of flow transactions across mobile ad hoc wireless network systems.

Throughput and Compatibility Analysis of TCP Variants in Heterogeneous Environment

2017 ◽  
pp. 254-287
Author(s):  
Sukant Kishoro Bisoy ◽  
Prasant Kumar Pattnaik ◽  
Narendra Kumar Kamila
Keyword(s):  
Wireless Network ◽  
Ad Hoc ◽  
Queue Management ◽  
Ad Hoc Routing ◽  
On Demand ◽  
Compatibility Analysis ◽  
Distance Vector ◽  
Simulation Results ◽  
Tcp Vegas ◽  
Tcp Reno

When TCP Reno and TCP Vegas connections share a link, TCP Reno generally steals more bandwidth and dominates TCP Vegas because of its aggressive nature. This is the major reason why TCP Vegas has not gained much popularity and deployment in the Internet despite its excellent standalone performance. This work systematically examines compatibility between Reno and Vegas in wired as well as in wireless networks. Popular Active Queue Management (AQM) technique named as Random Early Detection (RED) to minimize the incompatibility between Reno and Vegas in wired network. For wireless network two ad hoc routing protocols such as Ad Hoc On-Demand Distance Vector (AODV) and Destination-Sequenced Distance Vector (DSDV) are considered. Simulation results show that the incompatibility between Reno and Vegas in wired network is minimized using popular RED techniques. But in wireless ad hoc network environment Reno's aggressive behavior gets deteriorated while sharing with Vegas. Moreover, Reno and Vegas are more compatible in wireless network than wired network when both coexist in same time.

scholarly journals An overview of various ad hoc routing protocols in MANET

2018 ◽  
Vol 7 (2.21) ◽  
pp. 364
Author(s):  
Saritha Arumugam ◽  
N Kumar
Keyword(s):  
Wireless Network ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Network Routing ◽  
Delivery Ratio ◽  
Large Network ◽  
Ad Hoc Routing ◽  
Adhoc Network ◽  
Background Traffic

Mobile ad hoc network is a wireless network which has peer to peer process .it is established to achieve a group of network to be connected in wireless network. It is a large network that transfers the data from source to destination .Here we are computing the routing protocols like (DSDV, AODV, OLSR, DSR, TORA, and ZRP) which is analyzed in the form of packet delivery ratio, throughput, end to end delay, Routing overhead. There are three types of ADHOC network routing protocol 1) table driven proactive protocol acts as background traffic generally, in ADHOC  network the location of one node is send to other node through location this nodes transfer the data from one to other its done by DSDV and WRP. 2) on demand driven reactive it establish route between nodes when they are required to route packet data it is done by DSR and AODV. 3)  hybrid protocol each node has its own zone radius. 

Sign in / Sign up

Export Citation Format

Share Document