Minimum Delay Routing in Multihop Wireless Networks

Cheng, Min‐Yuan; Gong, Xuan; Wan, Peng‐Jun

doi:10.1007/978-3-642-23490-3_13

Cited by 3 publications

(6 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…From the above systems, the vitality proficient convention method has been decided for this task. In this convention, high vitality hubs need to take an interest in transmission maintaining a strategic distance from low vitality hub which would improve the lifetime of the system [15]. The quick neighbours get the data first and later it is transmitted to the whole system.…”

Section: T Venu Madhavmentioning

confidence: 99%

Energy Aware Relay GAF algorithm for WSN using Improved Conservative schemes

Madhav*

2019

IJEAT

View full text Add to dashboard Cite

Wireless sensor systems (WSN) is the system of Sensor Nodes (SNs) in which every hub have detecting, correspondence and calculation office. The fundamental impediment of WSN is that SNs have restricted vitality. So the fundamental focal point of research in WSN is to improve the Network Lifetime by falling vitality utilization. A few areas mindful directing convention has been proposed. Geographic Adaptive Fidelity (GAF) is one of the most famous vitality mindful steering conventions. It moderates vitality by recognizing equality between sensors from a steering point of view and after that killing superfluous sensors, while keeping up the availability of the system. Anyway conventional GAF can't achieve the ideal vitality use. It requires progressively number of jumps to transmit information from source to sink.so that it prompts higher bundle delay. The underlying issue of essential GAF is information can be sent in just flat and vertical. The issues which are being worked in this undertaking are minimization of jump check, parcel deferral and separation secured by the bundle postponement steering utilizing vitality mindful Relay GAF calculation Both the conventions are actualized in MATLAB. Investigation and reproduction results show critical enhancements of the projected work contrasting with customary GAF in the part of absolute jump check, arrange lifetime vitality utilization, all out separation secured by the information bundle before achieving the sink, and parcel delay

show abstract

Section: T Venu Madhavmentioning

confidence: 99%

Energy Aware Relay GAF algorithm for WSN using Improved Conservative schemes

Madhav*

2019

IJEAT

View full text Add to dashboard Cite

show abstract

“…Packet delay is an important metric for multihop wireless networks. It is to be noted that packet delay is a result of the total hop count and the distance covered by the data packet before reaching the destination [15]. Therefore, by minimizing the hop count and the total distance covered by the data packet, we can indirectly achieve the minimum packet delay.…”

Section: Two-level Gaf (T-gaf)mentioning

confidence: 99%

A Novel Scheme to Minimize Hop Count for GAF in Wireless Sensor Networks: Two-Level GAF

Soni

Mallick

2015

Journal of Computer Networks and Communications

View full text Add to dashboard Cite

In wireless sensor networks, geographic adaptive fidelity (GAF) is one of the most popular energy-aware routing protocols. It conserves energy by identifying equivalence between sensors from a routing perspective and then turning off unnecessary sensors, while maintaining the connectivity of the network. Nevertheless, the traditional GAF still cannot reach the optimum energy usage since it needs more number of hops to transmit data packets to the sink. As a result, it also leads to higher packet delay. In this paper, we propose a modified version of GAF to minimize hop count for data routing, called two-level GAF (T-GAF). Furthermore, we use a generalized version of GAF called Diagonal-GAF (DGAF) where two diagonal adjacent grids can also directly communicate. It has an advantage of less overhead of coordinator election based on the residual energy of sensors. Analysis and simulation results show significant improvements of the proposed work comparing to traditional GAF in the aspect of total hop count, energy consumption, total distance covered by the data packet before reaching the sink, and packet delay. As a result, compared to traditional GAF, it needs 40% to 47% less hop count and consumes 27% to 35% less energy to extend the network lifetime.

show abstract

“…Coverage is an important factor for the success of many monitoring and surveillance applications and thus can also be considered as a quality of service parameter in order to show how well a wireless sensor network can monitor physical regions [36]. The main objective of coverage is to guarantee that each physical region in the area of interest is within the sensing range of at least one sensor node.…”

Section: Coveragementioning

confidence: 99%

“…Area coverage has been proposed for many applications such as habitat monitoring, underwater surveillance, volcano monitoring network, forest fire detection, and birds habit monitoring [31,32,33,34,35,36]. Instead, in the target/critical point coverage problem, each target/critical point which are shown by triangle in Figure 2.2 needs to be monitored by at least one sensor node.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Quality-aware data gathering and disseminating in chain-based wireless sensor networks

Taghikhaki¹

View full text Add to dashboard Cite

Recently wireless sensor network has emerged as a promising technology that could induce an innovation wave in the field of (infra)structures monitoring because of its fast deployment, little interference with the surrounding, self-organization, flexibility and scalability. A key factor for the proliferation of this revolutionary technology is designing effective protocols to meet the quality of service requirements of the application considering deployment properties and characteristics.Structural condition monitoring using wireless sensor networks can be used for many (infra)structures such as bridge, railways, tunnel, pipelines and highways. These applications exhibit strong similarity in their deployment properties and the way that sensor nodes collect and disseminate their data. Monitoring condition, and operational performance of such large (infra)structures often requires wireless sensor network deployment to long stretch of narrow and elongated spreads which features a linear sensor arrangement and thus its topology resembles a chain. Moreover, ensuring quality of services has been put forward as an essential consideration for wireless sensor networks which are (i) often deployed in unattended and open environments and (ii) characterized by their limited resources and high unreliability. Quality of service in a wireless sensor network can be affected by several constraints out of which (i) the relative position of the node to the base station and other nodes, (ii) the internal reliability state of the network, (iii) the internal reliability state of individual sensor nodes, and (iv) the nodes' available power, are the most important ones. Quality of service support and guarantees in wireless sensor networks especially for linear wireless sensor networks, is an emerging area of research.In this context, the main focus of this thesis is the design and development of solutions to guarantee combination of four important quality of service parameters, i.e. coverage, long-lifetime, reliability and timeliness for chain-based topology data collection and dissemination. To this end, first we ensure quality of service to some extent at the topology level. However, quality-aware topology control alone is not sufficient to ensure quality of services for disseminating data of many applications Abstract ii whose packets may convey different types or amount of information. Therefore, we concentrate on using dynamic error control schemes which are allocating the correctional power in an on-demand manner based on both the packet-level constraints and channel state. In this way and for the sake of efficiency, we put the amount of information a packet carries or the time-constrained a sensory data imposes and the state in which the channel is in, into perspective with the amount of effort (in terms of energy expenditure) that is required to reliably transmit the given packets. The main contributions of this thesis can be summarized as follows: Trust-based probabilistic coverage: We investigate and address the cove...

show abstract

Minimum Delay Routing in Multihop Wireless Networks

Cited by 3 publications

References 15 publications

Energy Aware Relay GAF algorithm for WSN using Improved Conservative schemes

Energy Aware Relay GAF algorithm for WSN using Improved Conservative schemes

A Novel Scheme to Minimize Hop Count for GAF in Wireless Sensor Networks: Two-Level GAF

Quality-aware data gathering and disseminating in chain-based wireless sensor networks

Contact Info

Product

Resources

About