Abstract: The Internet of Everything (IoE) presents today a very attractive and motivating field of research. It is basically based on Wireless Sensor Networks (WSNs) in which the routing task is the major analysis topic. In fact, it directly affects the effectiveness and the lifetime of the network. This paper, developed from recent works and based on extensive researches, proposes a taxonomy of routing protocols in WSNs. Our main contribution is that we propose a classification model based on nine classes namely application type, delivery mode, initiator of communication, network architecture, path establishment (route discovery), network topology (structure), protocol operation, next hop selection and latency-awareness and energy-efficient routing protocols. In order to provide a total classification pattern to serve as reference for network designers, each class is subdivided into possible subclasses, presented, and discussed using different parameters such as purposes and characteristics.
Abstract: One of the problems to be addressed in wireless sensor networks is the issues related to cross layer communication. Cross layer architecture shares the information across the layer, ensuring Quality of Services (QoS). With this shared information, MAC protocol adapts effective functionality maintenance such as route selection on changeable sensor network environment. However, time slot assignment and neighbour route selection time duration for cross layer have not been carried out. The time varying physical layer communication over cross layer causes high traffic load in the sensor network. Though, the traffic load was reduced using cross layer optimization procedure, the computational cost is high. To improve communication efficacy in the sensor network, a self-determined time slot based Cross-Layered Neighbour Route Discovery (C-LNRD) method is presented in this paper. In the presented work, the initial process is to discover the route in the sensor network using Dynamic Source Routing based Medium Access Control (MAC) sub layers. This process considers MAC layer operation with dynamic route neighbour table discovery. Then, the discovered route path for packet communication employs Broad Route Distributed Time Slot Assignment method on Cross-Layered Sensor Network system. Broad Route means time slotting on varying length of the route paths. During packet communication in this sensor network, transmission of packets is adjusted over the different time with varying ranges for controlling the traffic rate. Finally, Rayleigh fading model is developed in C-LNRD to identify the performance of the sensor network communication structure. The main task of Rayleigh Fading is to measure the power level of each communication under MAC sub layer. The minimized power level helps to easily reduce the computational cost of packet communication in the sensor network. Experiments are conducted on factors such as power factor, on packet communication, neighbour route discovery time, and information (i.e., packet) propagation speed.
Abstract: Routing in adhoc networks is a challenge as nodes are
mobile, and links are constantly created and broken. Present ondemand
adhoc routing algorithms initiate route discovery after a path
breaks, incurring significant cost to detect disconnection and
establish a new route. Specifically, when a path is about to be broken,
the source is warned of the likelihood of a disconnection. The source
then initiates path discovery early, avoiding disconnection totally. A
path is considered about to break when link availability decreases.
This study modifies Adhoc On-demand Multipath Distance Vector
routing (AOMDV) so that route handoff occurs through link
availability estimation.
Abstract: Securing the confidential data transferred via wireless
network remains a challenging problem. It is paramount to ensure
that data are accessible only by the legitimate users rather than by the
attackers. One of the most serious threats to organization is jamming,
which disrupts the communication between any two pairs of nodes.
Therefore, designing an attack-defending scheme without any packet
loss in data transmission is an important challenge. In this paper,
Dependence based Malicious Route Defending DMRD Scheme has
been proposed in multi path routing environment to prevent jamming
attack. The key idea is to defend the malicious route to ensure
perspicuous transmission. This scheme develops a two layered
architecture and it operates in two different steps. In the first step,
possible routes are captured and their agent dependence values are
marked using triple agents. In the second step, the dependence values
are compared by performing comparator filtering to detect malicious
route as well as to identify a reliable route for secured data
transmission. By simulation studies, it is observed that the proposed
scheme significantly identifies malicious route by attaining lower
delay time and route discovery time; it also achieves higher
throughput.
Abstract: This paper investigates the joint effect of the
interconnected (n,k)-star network topology and Multi-Agent
automated control on restoration and reconfiguration of power
systems. With the increasing trend in development in Multi-Agent
control technologies applied to power system reconfiguration
in presence of faulty components or nodes. Fault tolerance is
becoming an important challenge in the design processes of the
distributed power system topology. Since the reconfiguration of a
power system is performed by agent communication, the (n,k)-star
interconnected network topology is studied and modeled in this
paper to optimize the process of power reconfiguration. In this paper,
we discuss the recently proposed (n,k)-star topology and examine its
properties and advantages as compared to the traditional multi-bus
power topologies. We design and simulate the topology model for
distributed power system test cases. A related lemma based on the
fault tolerance and conditional diagnosability properties is presented
and proved both theoretically and practically. The conclusion is
reached that (n,k)-star topology model has measurable advantages
compared to standard bus power systems while exhibiting fault
tolerance properties in power restoration, as well as showing
efficiency when applied to power system route discovery.
Abstract: A Mobile Ad-hoc Network (MANET) is a self managing network consists of versatile nodes that are capable of communicating with each other without having any fixed infrastructure. These nodes may be routers and/or hosts. Due to this dynamic nature of the network, routing protocols are vulnerable to various kinds of attacks. The black hole attack is one of the conspicuous security threats in MANETs. As the route discovery process is obligatory and customary, attackers make use of this loophole to get success in their motives to destruct the network. In Black hole attack the packet is redirected to a node that actually does not exist in the network. Many researchers have proposed different techniques to detect and prevent this type of attack. In this paper, we have analyzed various routing protocols in this context. Further we have shown a critical comparison among various protocols. We have shown various routing metrics are required proper and significant analysis of the protocol.
Abstract: Privacy and Security have emerged as an important research issue in Mobile Ad Hoc Networks (MANET) due to its unique nature such as scarce of resources and absence of centralized authority. There are number of protocols have been proposed to provide privacy and security for data communication in an adverse environment, but those protocols are compromised in many ways by the attackers. The concept of anonymity (in terms of unlinkability and unobservability) and pseudonymity has been introduced in this paper to ensure privacy and security. In this paper, a Secure Onion Throat (SOT) protocol is proposed to provide complete anonymity in an adverse environment. The SOT protocol is designed based on the combination of group signature and onion routing with ID-based encryption for route discovery. The security analysis demonstrates the performance of SOT protocol against all categories of attacks. The simulation results ensure the necessity and importance of the proposed SOT protocol in achieving such anonymity.
Abstract: An on-demand routing protocol for wireless ad hoc
networks is one that searches for and attempts to discover a route to
some destination node only when a sending node originates a data
packet addressed to that node. In order to avoid the need for such a
route discovery to be performed before each data packet is sent, such
routing protocols must cache routes previously discovered. This
paper presents an analysis of the effect of intelligent caching in a non
clustered network, using on-demand routing protocols in wireless ad
hoc networks. The analysis carried out is based on the Dynamic
Source Routing protocol (DSR), which operates entirely on-demand.
DSR uses the cache in every node to save the paths that are learnt
during route discovery procedure. In this implementation, caching
these paths only at intermediate nodes and using the paths from these
caches when required is tried. This technique helps in storing more
number of routes that are learnt without erasing the entries in the
cache, to store a new route that is learnt.
The simulation results on DSR have shown that this technique
drastically increases the available memory for caching the routes
discovered without affecting the performance of the DSR routing
protocol in any way, except for a small increase in end to end delay.
Abstract: Routing in mobile ad hoc networks is a challenging task because nodes are free to move randomly. In DSR like all On- Demand routing algorithms, route discovery mechanism is associated with great delay. More Clearly in DSR routing protocol to send route reply packet, when current route breaks, destination seeks a new route. In this paper we try to change route selection mechanism proactively. We also define a link stability parameter in which a stability value is assigned to each link. Given this feature, destination node can estimate stability of routes and can select the best and more stable route. Therefore we can reduce the delay and jitter of sending data packets.
Abstract: Trust and Energy consumption is the most challenging
issue in routing protocol design for Mobile ad hoc networks
(MANETs), since mobile nodes are battery powered and nodes
behaviour are unpredictable. Furthermore replacing and recharging
batteries and making nodes co-operative is often impossible in
critical environments like military applications. In this paper, we
propose a trust based energy aware routing model in MANET.
During route discovery, node with more trust and maximum energy
capacity is selected as a router based on a parameter called
'Reliability'. Route request from the source is accepted by a node
only if its reliability is high. Otherwise, the route request is
discarded. This approach forms a reliable route from source to
destination thus increasing network life time, improving energy
utilization and decreasing number of packet loss during transmission.
Abstract: The Mobile Ad-hoc Network (MANET) is a collection of self-configuring and rapidly deployed mobile nodes (routers) without any central infrastructure. Routing is one of the potential issues. Many routing protocols are reported but it is difficult to decide which one is best in all scenarios. In this paper on demand routing protocols DSR and DYMO based on IEEE 802.11 DCF MAC protocol are examined and characteristic summary of these routing protocols is presented. Their performance is analyzed and compared on performance measuring metrics throughput, dropped packets due to non availability of routes, duplicate RREQ generated for route discovery and normalized routing load by varying CBR data traffic load using QualNet 5.0.2 network simulator.
Abstract: Ant colony based routing algorithms are known to
grantee the packet delivery, but they suffer from the huge overhead
of control messages which are needed to discover the route. In this
paper we utilize the network nodes positions to group the nodes
in connected clusters. We use clusters-heads only on forwarding
the route discovery control messages. Our simulations proved that
the new algorithm has decreased the overhead dramatically without
affecting the delivery rate.
Abstract: The wireless adhoc network is comprised of wireless
node which can move freely and are connected among themselves
without central infrastructure. Due to the limited transmission range
of wireless interfaces, in most cases communication has to be relayed
over intermediate nodes. Thus, in such multihop network each node
(also called router) is independent, self-reliant and capable to route
the messages over the dynamic network topology. Various protocols
are reported in this field and it is very difficult to decide the best one.
A key issue in deciding which type of routing protocol is best for
adhoc networks is the communication overhead incurred by the
protocol. In this paper STAR a table driven and DSR on demand
protocols based on IEEE 802.11 are analyzed for their performance
on different performance measuring metrics versus varying traffic
CBR load using QualNet 5.0.2 network simulator.
Abstract: Most routing protocols (DSR, AODV etc.) that have
been designed for wireless adhoc networks incorporate the broadcasting
operation in their route discovery scheme. Probabilistic broadcasting
techniques have been developed to optimize the broadcast operation
which is otherwise very expensive in terms of the redundancy
and the traffic it generates. In this paper we have explored percolation
theory to gain a different perspective on probabilistic broadcasting
schemes which have been actively researched in the recent years.
This theory has helped us estimate the value of broadcast probability
in a wireless adhoc network as a function of the size of the network.
We also show that, operating at those optimal values of broadcast
probability there is at least 25-30% reduction in packet regeneration
during successful broadcasting.
Abstract: Genetic Zone Routing Protocol (GZRP) is a new
hybrid routing protocol for MANETs which is an extension of ZRP
by using Genetic Algorithm (GA). GZRP uses GA on IERP and BRP
parts of ZRP to provide a limited set of alternative routes to the
destination in order to load balance the network and robustness
during node/link failure during the route discovery process. GZRP is
studied for its performance compared to ZRP in many folds like
scalability for packet delivery and proved with improved results. This
paper presents the results of the effect of load balancing on GZRP.
The results show that GZRP outperforms ZRP while balancing the
load.
Abstract: Mobile Ad hoc network consists of a set of mobile
nodes. It is a dynamic network which does not have fixed topology.
This network does not have any infrastructure or central
administration, hence it is called infrastructure-less network. The
change in topology makes the route from source to destination as
dynamic fixed and changes with respect to time. The nature of
network requires the algorithm to perform route discovery, maintain
route and detect failure along the path between two nodes [1]. This
paper presents the enhancements of ARA [2] to improve the
performance of routing algorithm. ARA [2] finds route between
nodes in mobile ad-hoc network. The algorithm is on-demand source
initiated routing algorithm. This is based on the principles of swarm
intelligence. The algorithm is adaptive, scalable and favors load
balancing. The improvements suggested in this paper are handling of
loss ants and resource reservation.