Search results

Designing an efficient routing protocol that opportunistically forwards data to the destination node through nearby sensor nodes or devices is significantly important for an effective incidence response and disaster recovery framework. Existing sensor routing protocols are mostly not effective in such disaster recovery applications as the networks are affected (destroyed or overused) in disasters such as earthquake, flood, Tsunami and wildfire. These protocols require a large number of message transmissions to reestablish the clusters and communications that is not energy efficient and result in packet loss. This paper introduces ODCR - an energy efficient and reliable opportunistic density clustered-based routing protocol for such emergency sensor applications. We perform simulation to measure the performance of ODCR protocol in terms of network energy consumptions, throughput and packet loss ratio. Simulation results demonstrate that the ODCR protocol is much better than the existing TEEN, LEACH and LORA protocols in term of these performance metrics.

The internet of vehicles (IoV) communication has recently become a popular research topic in the automotive industry. The growth in the automotive sector has resulted in significant standards and guidelines that have engaged various researchers and companies. In IoV, routing protocols play a significant role in enhancing communication safety for the transportation system. The high mobility of nodes in IoV and inconsistent network coverage in different areas make routing challenging. This paper aims to provide a lane-based advanced forwarding protocol for internet of vehicles (LAFP-IoV) for efficient data distribution in IoV. The proposed protocol’s main feature is that it can identify the destination zone by using position coordinates and broadcasting the packets toward the direction of destination. The novel suppression technique is used in the broadcast method to reduce the network routing overhead.

The proposed protocol considers the interferences between different road segments, and a novel lane-based forwarding model is presented. The greedy forwarding notion, the broadcasting mechanism, and the suppression approach are used in this protocol to reduce the overhead generated by standard beacon forwarding procedures. The SUMO tool and NS-2 simulator are used for the vehicle's movement pattern and to simulate LAFP-IoV.

The simulation results show that the proposed LAFP-IoV protocol performs better than its peer protocols. It uses a greedy method for forwarding data packets and a carry-and-forward strategy to recover from the local maximum stage. This protocol's low latency and good PDR make it ideal for congested networks.

The proposed paper provides a unique lane-based forwarding for IoV. The proposed work achieves a higher delivery ratio than its peer protocols. The proposed protocol considers the lanes while forwarding the data packets applicable to the highly dense scenarios.

This paper aims to propose an algorithm, location-aware opportunistic content forwarding (LOC), to improve message directivity using direction vectors in opportunistic networks. The LOC is based on the assumption that if approximate location of the destination node is known, then overall message delivery and cost can be improved. Efficient message delivery with low communication cost is a major challenge in current opportunistic networks. In these networks, nodes do not have prior knowledge of their recipients, and message forwarding can be achieved by selecting suitable forwarder based on some forwarding criteria, as compared to its ancestor mobile ad hoc networks.

In this paper, the authors tested LOC in two sets of mobility models, synthetic movement model and real mobility data sets. In the first set, working day movement is used as synthetic movement model, where proposed algorithm is compared against Lobby Influence (LI) and Epidemic algorithms. In the second set of experiments, the new algorithm is tested in three mobility data sets, namely, Cambridge, Reality and Sassy, and results compared against LI algorithm. The reason of using various movement models is to establish strengths and weaknesses of the proposed algorithm in different scenarios.

The experimental results show that the new algorithm performed extremely well in different scenarios, not only in terms of overall message delivery but also successfully managed to reduce the communication cost.

The new contribution increases the overall energy and storage efficiency of nodes by targeting relevant forwarding nodes in the network.

End-to-end latency in network affects the overall performance in number of ways. It is one of the major tasks to minimize the end-to-end latency in cognitive radio ad hoc networks (CRAHN), as the transmission of packets passes through every hop of the routing path. This paper aims to propose a new reactive multicast routing protocol, namely, improved frog leap inspired protocol (IFLIP) to reduce the overall end-to-end latency in CRAHN.

It is difficult to solve the problems that emerge in optimization. Routing is the procedure for choosing the best network path. This paper proposes a novel algorithm by improving the FLIP to use an ideal route, which progressively reduces the congestion level on various routing path by considering the spectrum accessibility and the service rate of each hop in CRAHN.

Result of this research work concludes that IFLIP significantly outperforms other baseline schemes (namely, TIGHT and Greedy TIGHT) in minimizing the end-to-end latency in CRAHN.

It is proved that IFLIP gives a better ratio of packet delivery under varying primary users and secondary users. IFLIP results in increased packet deliver ratio, reduced end-to-end latency and better throughput.

The purpose of this paper is to design an efficient on-demand routing protocol for mobile ad hoc networks (MANETs) which combines greedy forwarding and backtracking.

It uses a hybrid approach. It uses greedy approach to determine a route from source to the destination. If the greedy approach fails, then it uses a backtracking approach. Combining greedy and backtracking approaches results in a more efficient protocol.

A new routing algorithm for MANETs which performs better than some of the existing algorithms.

A major limitation of this work is that the authors did not implement the protocol on a test bed and evaluated the performance. They neither had the infrastructure nor the resources to actually implement the protocol. Instead, like most of the researchers, they evaluated the performance of their protocol based on extensive simulation. The mobility model, the area of deployment and the density of nodes chosen to simulate the protocol are consistent with what many of the other researchers have done. Intuitively, the authors’ protocol, as the performance evaluation indicates, is likely to perform well in small networks.

The authors did not implement the protocol on a test bed to evaluate the performance of the protocol. The authors used simulation to study the performance of their protocol. Their simulation model is similar to many of the research works published in the literature.

To the authors’ knowledge, no other paper has combined the greedy and backtracking approach to design a routing protocols for MANETs.

Wireless Multimedia Sensor Network (WMSN) is expected to be a key technology for future network. The multimodal information along with very low-cost availability of the camera sensor nodes is promoting the extensive use of audio, image and video in various real-time implementations. The purpose of this paper is to study various routing issues and the effect of mobility on existing solutions for the applications in future internet.

This paper conducts a survey of the various methodologies for routing and the vital issues in the design of routing protocols for WMSN, and it also discusses about the effect of mobility on various routing methodologies of WMSN. WMSN ubiquitously performs data acquisition, processing and routing for scalar and multimedia data in a mobile environment. The routing protocols should be adaptive in nature and should have a dynamic approach to service effectively for future network. Many authors proposed the mobility of sink to improve lifetime of the network. This paper discusses some effective approaches for the network where not only the sink node but also some of the sensor nodes are mobile.

During the survey, the performance and lifetime of the network are discussed, other parameters like delay, packet loss, energy consumption and simulators used for implementation are also discussed.

The techniques in this paper represent a considerable solution for mobility issues in future internet applications.

With the rapid growth of wireless sensor networks (WSNs), they have become an integral and substantial part of people's life. As such WSN stands as an assuring outlook, but because of sensor's resource limitations and other prerequisites, optimal dual route discovery becomes an issue of concern. WSN along with central sink node is capable of handling wireless transmission, thus optimizing the network's lifetime by selecting the dual path. The major problem confronted in the application of security mechanisms in WSNs is resolving the issues amid reducing consumption of resources and increases security.

According to the proposed system, two metrics, namely, path length and packets delivery ratio are incorporated for identifying dual routes amid the source and destination. Thereafter by making use of the distance metric, the optimal dual route is chosen and data transmission is carried out amid the nodes. With the usage of the recommended routing protocol high packet delivery ratio is achieved with reduced routing overhead and low average end to end delay. It is clearly portrayed in the simulation output that the proposed on demand dual path routing protocol surpasses the prevailing routing protocol. Moreover, security is achieved make use of in accord the data compression reduces the size of the data. With the help of dual path, mathematical model of Finite Automata Theory is derived to transmit data from source to destination. Finite Automata Theory comprises Deterministic Finite Automata (DFA) that is being utilized for Dual Path Selection. In addition, data transition functions are defined for each input stage. In this proposed work, another mathematical model is 10; introduced to efficiently choose an alternate path between a receiver and transmitter for data transfer with qualified node as relay node using RR Algorithm. It also includes Dynamic Mathematical Model for Node Localization to improve the precision in location estimation using Node Localization Algorithm. As a result a simulator is built and various scenarios are elaborated for comparing the performance of the recommended dual path routing protocol with respect to the prevailing ones.

Reliability and fault-tolerance: The actual motive in utilizing the approach of multipath routing in sensor network was to offer path resilience in case of a node or link failures thus ascertaining reliable transmission of data. Usually in a fault tolerant domain, when the sensor node is unable to forward the data packets to the sink, alternative paths can be utilized for recovering its data packets during the failure of any link/node. Load balancing: Load balancing involves equalizing energy consumption of all the existing nodes, thereby degrading them together. Load balancing via clustering improves network scalability. The network's lifetime as well as reliability can be extended if varied energy level's nodes exist in sensor node. Quality of service (QoS): Improvement backing of quality of service with respect to the data delivery ratio, network throughput and end-to-end latency stands very significant in building multipath routing protocols for various network types. Reduced delay: There is a reduced delay in multipath routing since the backup routes are determined at the time of route discovery. Bandwidth aggregation: By dividing the data toward the same destination into multiple streams (by routing all to a separate path) can aggregate the effective bandwidth. The benefit being that, in case a node possesses many links with low bandwidth, it can acquire a bandwidth which is more compared to the individual link.

Few more new algorithms can be used to compare the QoS parameters.

Proposed mechanism with feedback ascertains improvised delivery ratio compared to the single path protocol since in case of link failure, the protocol has alternative route. In case there are 50 nodes in the network, the detection mechanism yields packet delivery of 95% and in case there are 100 nodes, the packet delivery is lowered to 89%. It is observed that the packet rate in the network is more for small node range. When the node count is 200, the packet ratio is low, which is lowered to 85%. With a node count of 400, the curve depicts the value of 87%. Hence, even with a decrease in value, it is superior than the existing protocols. The average end-to-end delay represents the transmission delay of the data packets that have been successfully delivered as depicted in Figure 6 and Table 3. The recommended system presents the queue as well as the propagation delay from the source to destination. The figure depicts that when compared to the single path protocol, the end-to-end delay can be reduced via route switching. End-to-end delay signifies the time acquired for the delay in the receival of the the retransmitted packet by each node. The comparison reveals that the delay was lower compared to the existing ones in the WSN. Proposed protocol aids in reducing consumption of energy in transmitter, receiver and various sensors. Comparative analysis of energy consumptions of the sensor in regard to the recommended system must exhibit reduced energy than the prevailing systems.

On demand dual path routing protocol. Hence it is verified that the on demand routing protocol comprises DFA algorithms determines dual path. Here mathematical model for routing between two nodes with relay node is derived using RR algorithm to determine alternate path and thus reduce energy consumption. Another dynamic mathematical model for node localization is derived using localization algorithm. For transmitting data with a secure and promising QoS in the WSNs, the routing optimization technique has been introduced. The simulation software environment follows the DFA. The simulation yields in improvised performance with respect to packet delivery ratio, throughput, average end-to-end delay and routing overhead. So, it is proved that the DFA possesses the capability of optimizing the routing algorithms which facilitates the multimedia applications over WSNs.

A wide number of technologies are currently in store to harness the challenges posed by pandemic situations. As such diseases transmit by way of person-to-person contact or by any other means, the World Health Organization had recommended location tracking and tracing of people either infected or contacted with the patients as one of the standard operating procedures and has also outlined protocols for incident management. Government agencies use different inputs such as smartphone signals and details from the respondent to prepare the travel log of patients. Each and every event of their trace such as stay points, revisit locations and meeting points is important. More trained staffs and tools are required under the traditional system of contact tracing. At the time of the spiralling patient count, the time-bound tracing of primary and secondary contacts may not be possible, and there are chances of human errors as well. In this context, the purpose of this paper is to propose an algorithm called SemTraClus-Tracer, an efficient approach for computing the movement of individuals and analysing the possibility of pandemic spread and vulnerability of the locations.

Pandemic situations push the world into existential crises. In this context, this paper proposes an algorithm called SemTraClus-Tracer, an efficient approach for computing the movement of individuals and analysing the possibility of pandemic spread and vulnerability of the locations. By exploring the daily mobility and activities of the general public, the system identifies multiple levels of contacts with respect to an infected person and extracts semantic information by considering vital factors that can induce virus spread. It grades different geographic locations according to a measure called weightage of participation so that vulnerable locations can be easily identified. This paper gives directions on the advantages of using spatio-temporal aggregate queries for extracting general characteristics of social mobility. The system also facilitates room for the generation of various information by combing through the medical reports of the patients.

It is identified that context of movement is important; hence, the existing SemTraClus algorithm is modified by accounting for four important factors such as stay point, contact presence, stay time of primary contacts and waypoint severity. The priority level can be reconfigured according to the interest of authority. This approach reduces the overwhelming task of contact tracing. Different functionalities provided by the system are also explained. As the real data set is not available, experiments are conducted with similar data and results are shown for different types of journeys in different geographical locations. The proposed method efficiently handles computational movement and activity analysis by incorporating various relevant semantics of trajectories. The incorporation of cluster-based aggregate queries in the model do away with the computational headache of processing the entire mobility data.

As the trajectory of patients is not available, the authors have used the standard data sets for experimentation, which serve the purpose.

This paper proposes a framework infrastructure that allows the emergency response team to grab multiple information based on the tracked mobility details of a patient and facilitates room for various activities for the mitigation of pandemics such as the prediction of hotspots, identification of stay locations and suggestion of possible locations of primary and secondary contacts, creation of clusters of hotspots and identification of nearby medical assistance. The system provides an efficient way of activity analysis by computing the mobility of people and identifying features of geographical locations where people travelled. While formulating the framework, the authors have reviewed many different implementation plans and protocols and arrived at the conclusion that the core strategy followed is more or less the same. For the sake of a reference model, the Indian scenario is adopted for defining the concepts.