Relevant bibliographies by topics / Reliable-aware Routing

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Reliable-aware Routing'

Author: Grafiati
Published: 4 June 2021
Last updated: 6 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Reliable-aware Routing.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Reliable-aware Routing"

1

Tufail, Ali. "Reliable Latency-Aware Routing for Clustered WSNs." International Journal of Distributed Sensor Networks 8, no. 3 (2012): 681273. http://dx.doi.org/10.1155/2012/681273.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ali, Munsif, Anwar Khan, Hasan Mahmood, and Naeeem Bhatti. "Cooperative, reliable, and stability-aware routing for underwater wireless sensor networks." International Journal of Distributed Sensor Networks 15, no. 6 (2019): 155014771985424. http://dx.doi.org/10.1177/1550147719854249.

Full text
Abstract:
In underwater wireless sensor networks, stability and reliability of the network are of paramount importance. Stability of the network ensures persistent operation of the network that, in consequence, avoids data loss when nodes consume all the battery power and subject to death. Particularly, nodes bearing a low pressure of water die early in the usual routing approach due to being preferred choices for data routing. Reliability ensures minimization of the adverse channel effects on data packets so that the desired information is easily extracted from these packets. This article proposes two routing protocols for underwater wireless sensor networks: reliable and stability-aware routing and cooperative reliable and stability-aware routing. In reliable and stability-aware routing, energy assignment to a node is made on the basis of its depth. Sensor nodes having the lowest depth are assigned the highest amount of energy. This energy assignment is called the energy grade of a node and five energy grades are formed in the proposed network from top to bottom. The energy grade along with energy residing in a node battery and its depth decide its selection as a forwarder node. The reliable and stability-aware routing uses only a single link to forward packets. Such a link may not be reliable always. To overcome this issue, the cooperative reliable and stability-aware routing is proposed which introduces cooperative routing to reliable and stability-aware routing. Cooperative routing involves the reception of multiple copies of data symbols by destination. This minimizes the adverse channel effects on data packets and makes the information extraction convenient and less cumbersome at the final destination. Unlike the conventional approach, the proposed schemes do not take into account the coordinates of nodes for defining the routing trajectories, which is challenging in underwater medium. Simulation results reveal a better behavior of the proposed protocols than some competitive schemes in terms of providing stability to the network, packet transfer to the ultimate destination, and latency.
APA, Harvard, Vancouver, ISO, and other styles
3

Sarkar, Sajal. "Mobility aware and reliable multipath routing protocol for MANETs." International Journal of Ad Hoc and Ubiquitous Computing 41, no. 4 (2022): 256. http://dx.doi.org/10.1504/ijahuc.2022.126786.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Touati, Habib Chawki, and Fateh Boutekkouk. "Reliable Weighted Globally Congestion Aware Routing for Network on Chip." International Journal of Embedded and Real-Time Communication Systems 11, no. 3 (2020): 48–66. http://dx.doi.org/10.4018/ijertcs.2020070103.

Full text
Abstract:
With the ability to incorporate hundreds of communicating cores on a single chip, thanks to the continuous shrinkage in sizes, communication became of the utmost importance. Consequently, the reduction of transmission delays became unavoidably necessary. All of which is achieved by means of routing algorithms, responsible for selecting the most appropriate routes for data packets, by avoiding congested regions in the network between any pair of source and destination nodes. In this article, two moderately distinct versions in terms of weight distribution of a minimal, fully adaptive, congestion-aware routing scheme in mesh-based network on chip and its accompanying congestion propagation network, are presented. The algorithm does not rely solely on local congestion information nor on irrelevant global information, and provides somewhat a compromise between locally and globally aware routing. The experimental results showcase the proposed scheme's superiority over state of the art NoC routing algorithms.
APA, Harvard, Vancouver, ISO, and other styles
5

Kumar, Nagesh, Yashwant Singh, and Pradeep Kumar Singh. "An Energy Efficient Trust Aware Opportunistic Routing Protocol for Wireless Sensor Network." International Journal of Information System Modeling and Design 8, no. 2 (2017): 30–44. http://dx.doi.org/10.4018/ijismd.2017040102.

Full text
Abstract:
As the wireless sensor networks (WSN) are gaining popularity the need of reliable delivery of data packets becomes more important. The reliable delivery is only possible when the routing protocols are efficient and secure. Because of lack of resources it is not possible to use existing cryptosystems to provide security in WSN. But, trust aware routing can provide the security with lesser resources, which become popular in last three to four years. In this paper, a new energy efficient and trust aware reliable opportunistic routing (TAEROR) protocol is proposed. The protocol consists of a trust metric and also a relay selection algorithm. The trust aware metric detects the malicious nodes on the basis of forwarding sincerity, energy consumption and acknowledgement sincerity. Relay selection algorithms avoid these malicious nodes to get selected in the routing process. The protocol is simulated and compared to existing trust aware routing protocols. Proposed protocol TEAROR presents better results than the other compared protocols.
APA, Harvard, Vancouver, ISO, and other styles
6

Zardari, Nawaz Ali, Razali Ngah, Omar Hayat, and Ali Hassan Sodhro. "Adaptive mobility-aware and reliable routing protocols for healthcare vehicular network." Mathematical Biosciences and Engineering 19, no. 7 (2022): 7156–77. http://dx.doi.org/10.3934/mbe.2022338.

Full text
Abstract:
<abstract> <p>Healthcare vehicles such as ambulances are the key drivers for digital and pervasive remote care for elderly patients. Thus, Healthcare Vehicular Ad Hoc Network (H-VANET) plays a vital role to empower the digital and Intelligent Transportation System (ITS) for the smart medical world. Quality of Service (QoS) performance of vehicular communication can be improved through the development of a robust routing protocol having enhanced reliability and scalability. One of the most important issues in vehicular technology is allowing drivers to make trustworthy decisions, therefore building an efficient routing protocol that maintains an appropriate level of Quality of Service is a difficult task. Restricted mobility, high vehicle speeds, and continually changing topologies characterize the vehicular network environment. This paper contributes in four ways. First, it introduces adaptive, mobility-aware, and reliable routing protocols. The optimization of two routing protocols which are based on changing nature topologies of the network used for vehicular networks has been performed, amongst them, Optimized Link State Routing (Proactive) and Ad-hoc on Demand Distance Vector (Reactive) are considered for Packet Delivery Ratio (PDR) and throughput. Furthermore, Packet Loss Ratio (PLR), and end-to-end (E2E) delay parameters have also been calculated. Second, a healthcare vehicle system architecture for elderly patients is proposed. Third, a Platoon-based System model for routing protocols in VANET is proposed. Fourth, a dynamic channel model has been proposed for the vehicle to vehicle communication using IEEE8011.p. To optimize the QoS, the experimental setup is conducted in a discrete Network Simulator (NS-3) environment. The results reveal that the AODV routing protocol gives better performance for PDR as well as for PLR and the communication link established is also reliable for throughput. Where OLSR produces a large average delay. The adoptive mobility-aware routing protocols are potential candidates for providing Intelligent Transportation Systems with acceptable mobility, high reliability, high PDR, low PLR, and low E2E delay.</p> </abstract>
APA, Harvard, Vancouver, ISO, and other styles
7

Cho, Byeong Seok, Juhyeon Lee, and Hyung-Kun Park. "Channel Aware Reliable Routing Protocol in Wireless Multimedia Sensor Networks." Journal of the Korea Institute of Information and Communication Engineering 18, no. 2 (2014): 459–65. http://dx.doi.org/10.6109/jkiice.2014.18.2.459.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Sarkar, Sajal. "Reliable and energy-aware routing in mobile ad-hoc networks." International Journal of Wireless and Mobile Computing 16, no. 2 (2019): 117. http://dx.doi.org/10.1504/ijwmc.2019.099020.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sarkar, Sajal. "Reliable and energy-aware routing in mobile ad-hoc networks." International Journal of Wireless and Mobile Computing 16, no. 2 (2019): 117. http://dx.doi.org/10.1504/ijwmc.2019.10020376.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Karim, L., and N. Nasser. "Reliable location-aware routing protocol for mobile wireless sensor network." IET Communications 6, no. 14 (2012): 2149. http://dx.doi.org/10.1049/iet-com.2011.0696.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Reliable-aware Routing"

1

Khan, Shariq Mahmood. "Reliable on-demand routing protocols for mobile ad-hoc networks." Thesis, Brunel University, 2015. http://bura.brunel.ac.uk/handle/2438/11627.

Full text
Abstract:
Mobile Ad-Hoc Network (MANET) facilitates the creation of dynamic reconfigurable networks, without centralized infrastructure. MANET routing protocols have to face high challenges like link instability, node mobility, frequently changing topologies and energy consumption of node, due to these challenges routing becomes one of the core issues in MANETs. This Thesis mainly focuses on the reactive routing protocol such as Ad-Hoc On-Demand Distance Vector (AODV) routing protocol. Reliable and Efficient Reactive Routing Protocol (RERRP) for MANET has been proposed to reduce the link breakages between the moving nodes. This scheme selects a reliable route using Reliability Factor (RF); the RF considers Route Expiration Time and Hop Count to select a routing path with high reliability and have less number of hops. The simulation result shows that RERRP outperforms AODV and enhance the packet delivery fraction (PDF) by around 6% and reduces the network routing load (NRL) by around 30%. Broadcasting in MANET could cause serious redundancy, contention, and collision of the packets. A scheme, Effective Broadcast Control Routing Protocol (EBCRP) has been proposed for the controlling of broadcast storm problem in a MANET. The EBCRP is mainly selects the reliable node while controlling the redundant re-broadcast of the route request packet. The proposed algorithm EBCRP is an on-demand routing protocol, therefore AODV route discovery mechanism was selected as the base of this scheme. The analysis of the performance of EBCRP has revealed that the EBCRP have controlled the routing overhead significantly, reduces it around 70% and enhance the packet delivery by 13% as compared to AODV. An Energy Sensible and Route Stability Based Routing Protocol (ESRSBR) have also been proposed that mainly focuses on increasing the network lifetime with better packet delivery. The ESRSBR supports those nodes to participate in the data transfer that have more residual energy related to their neighbour nodes. The proposed protocol also keeps track of the stability of the links between the nodes. Finally, the ESRSBR selects those routes which consist of nodes that have more residual energy and have stable links. The comparative analysis of ESRSBR with AODV and recently proposed routing protocol called Link Stability and Energy Aware (LSEA) routing protocol revealed that the proposed protocol ESRSBR has a significantly affect the network lifetime, increases it around 10% and 13% as compared to LSEA and AODV protocols respectively. The ESRSBR also decreases the routing overhead by 22% over LSEA and by 38% over AODV.
APA, Harvard, Vancouver, ISO, and other styles
2

wang, chung-kai, and 王俊凱. "An Improvement on Reliable Energy Aware Routing in Wireless Sensor Networks." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/59056634710823313607.

Full text
Abstract:
碩士<br>元智大學<br>資訊工程學系<br>98<br>The mainly application of WSN(Wireless Sensor Networks ) is monitoring a particular environment and producing data, then assured delivery these data to sink. For this purpose, WSN must has different protocol to process different tasks, for example, route protocol, Mac protocol, transport protocol ..... etc. Because WSN usually uses battery for power supply, and difficult to recharge or to replace, therefore, the power consumption is a most important issue in WSN. Routing protocol is building a forwarding path between the sink and source for data transmission. When we try to find a path, if only concerning any single condition, like reliability, delay or another, then it maybe lead to use some sensor node too frequency and make these nodes deplete their energy too quickly then dead. Routing protocol also must has solution to face transmission path broken maked by node dead. This paper introduce IRER(An Improvement on Reliable Energy Aware Routing in Wireless Sensor Networks), through distinguish the “available energy” and the “remaining energy”, to make different path can distributed on different node set and further to balance power consumption on each node. IRER also attempts to restrain the frequency of reRoute by local repair then economizes the power consumption.
APA, Harvard, Vancouver, ISO, and other styles
3

Praveen, Kumar M. "Potential-Based Routing In Wireless Sensor Networks." Thesis, 2008. http://hdl.handle.net/2005/767.

Full text
Abstract:
Recent advances in VLSI technology, and wireless communication have enabled the development of tiny, low-cost sensor nodes that communicate over short distances. These sensor nodes, which consist of sensing, data processing, and wireless communication capabilities, suggest the idea of sensor networks based on collaborative effort of a large number of sensor nodes. Sensor networks hold the promise for numerous applications such as intrusion detection, weather monitoring, security and tactical surveillance, distributed computing, and disaster management. Several new protocols and algorithms have been proposed in the recent past in order to realize these applications. In this thesis, we consider the problem of routing in Wireless Sensor Networks (WSNs). Routing is a challenging problem in WSNs due to the inherent characteristics which distinguish these networks from the others. Several routing algorithms have been proposed for WSNs, each considering a specific network performance objective such as long network lifetime (ChangandTassiulas,2004), end-to-end delay guarantees (T.Heetal,2003), and data fusion (RazvanCristescuetal,2005) etc. In this thesis, we utilize the Potential-based Routing Paradigm to develop routing algorithms for different performance objectives of interest in WSNs. The basic idea behind the proposed approach is to assign a scalar called the potential to every sensor node in the network. Data is then forwarded to the neighbor with highest potential. Potentials cause the data to flow along certain paths. By defining potential fields appropriately, one can cause data to flow along preferred paths, so that the given performance objective is achieved. We have demonstrated the usefulness of this approach by considering three performance objectives, and defining potentials appropriately in each case. The performance objectives that we have considered are (i) maximizing the time to network partition, (ii) maximizing the packet delivery ratio, and (iii) Data fusion. In an operational sensor network, sensor nodes’ energy levels gradually deplete, leading eventually to network partition. A natural objective is to route packets in such a way that the time to network partition is maximized. We have developed a potential function for this objective. We analyzed simple network cases and used the insight to develop a potential function applicable to any network. Simulation results showed that considerable improvements in time to network partition can be obtained compared to popular approaches such as maximum lifetime routing, and shortest hop count routing. In the next step, we designed a potential function that leads to routes with high packet delivery ratios. We proposed a “channel-state aware” potential definition for a simple 2-relay network and performed a Markov-chain based analysis to obtain the packet delivery ratio. Considerable improvement was observed compared to a channel-state-oblivious policy. This motivated us to define a channel-state-dependent potential function for a general network. Simulation results showed that for a relatively slowly changing wireless network, our approach can provide up to 20% better performance than the commonly-used shortest-hop-count routing. Finally, we considered the problem of correlated data gathering in sensor networks. The routing approach followed in literature is to construct a spanning tree rooted at the sink. Every node in the tree aggregates its data with the data from its children in order to reduce the number of transmitted bits. Due to this fact, the total energy cost of the data collection task is a function of the underlying tree structure. Noting that potential based routing schemes also result in a tree structure, we present a potential definition that results in the minimum energy cost tree under some special conditions. Specifically, we consider a scenario in which sensor nodes’ measurements are quantized to K values. The task at the sink is to construct a histogram of measurements of all sensor nodes. Sensor nodes do not directly send their measurements to sink. Instead, they construct a temporary histogram using the data from its children and forward it to its parent node in the tree. We present a potential definition that results in the minimum energy cost tree under some conditions on sensor nodes’ measurements. We include both the transmission energy cost as well as the energy cost associated with the aggregation process.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Reliable-aware Routing"

1

Samara, Kamil, and Hossein Hosseini. "Aware Diffusion Routing Protocol with Reliable Data Delivery Provision." In Advances in Intelligent Systems and Computing. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-63092-8_32.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Srivastava, Ankita, and Arun Prakash. "Reliable Location-Aware Routing Protocol for Urban Vehicular Scenario." In Lecture Notes in Electrical Engineering. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-32-9775-3_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Mohammad, Arshad Ahmad Khan, Ali Mirza Mahmood, and Srikanth Vemuru. "Energy-Aware Reliable Routing by Considering Current Residual Condition of Nodes in MANETs." In Soft Computing in Data Analytics. Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-0514-6_44.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bose Paul, Amrita, Susmita Mondal, Santosh Biswas, and Sukumar Nandi. "TA-ACS: A Trust Aware Adaptive Carrier Selection Scheme for Reliable Routing in Delay Tolerant Networks." In Innovations for Community Services. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-37484-6_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kumar, Nagesh, Yashwant Singh, and Pradeep Kumar Singh. "An Energy Efficient Trust Aware Opportunistic Routing Protocol for Wireless Sensor Network." In Sensor Technology. IGI Global, 2020. http://dx.doi.org/10.4018/978-1-7998-2454-1.ch030.

Full text
Abstract:
As the wireless sensor networks (WSN) are gaining popularity the need of reliable delivery of data packets becomes more important. The reliable delivery is only possible when the routing protocols are efficient and secure. Because of lack of resources it is not possible to use existing cryptosystems to provide security in WSN. But, trust aware routing can provide the security with lesser resources, which become popular in last three to four years. In this paper, a new energy efficient and trust aware reliable opportunistic routing (TAEROR) protocol is proposed. The protocol consists of a trust metric and also a relay selection algorithm. The trust aware metric detects the malicious nodes on the basis of forwarding sincerity, energy consumption and acknowledgement sincerity. Relay selection algorithms avoid these malicious nodes to get selected in the routing process. The protocol is simulated and compared to existing trust aware routing protocols. Proposed protocol TEAROR presents better results than the other compared protocols.
APA, Harvard, Vancouver, ISO, and other styles
6

Abreu, Carlos, and Paulo M. Mendes. "Extending Lifetime of Biomedical Wireless Sensor Networks using Energy-Aware Routing and Relay Nodes." In Biomedical Engineering. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-3158-6.ch031.

Full text
Abstract:
Biomedical wireless sensor networks are a key technology to enable the development of new healthcare services and/or applications, reducing costs and improving the citizen's quality of life. However, since they deal with health data, such networks should implement mechanisms to enforce high levels of quality of service. In most cases, the sensor nodes that form such networks are small and battery powered, and these extra quality of service mechanisms mean significant lifetime reduction due to the extra energy consumption. The network lifetime is thus a relevant feature to ensure the necessary quality of service requirements. In order to maximise the network lifetime, and its ability to offer the required quality of service, new strategies are needed to increase the energy efficiency, and balance in the network. The focus of this work goes to the effective use of the available energy in each node, combined with information about the reliability of the wireless links, as a metric to form reliable and energy-aware routes throughout the network. This paper present and discusses two different deployment strategies using energy-aware routing and relay nodes, assessed for different logical topologies. The authors' conclusion is that the use of energy-aware routing combined with strategic placed relay nodes my increase the network lifetime as high as 45%.
APA, Harvard, Vancouver, ISO, and other styles
7

Ayaz, Muhammad, Azween Abdullah, and Ibrahima Faye. "A Taxonomy of Routing Techniques in Underwater Wireless Sensor Networks." In Wireless Sensor Networks and Energy Efficiency. IGI Global, 2012. http://dx.doi.org/10.4018/978-1-4666-0101-7.ch006.

Full text
Abstract:
Underwater Wireless Sensor Networks (UWSNs) are finding different applications for offshore exploration and ocean monitoring. In most of these applications, the network consists of a significant number of sensor nodes deployed at different depth levels throughout the area of interest. Sensor nodes on the sea bed cannot communicate directly with the nodes near the surface level, so they require multihop communication assisted by an appropriate routing scheme. However, this appropriateness not only depends on network resources and application requirements, but environment constraints are involved as well. These factors all provide a platform where a resource aware routing strategy plays a vital role in fulfilling different application requirements with dynamic environment conditions. Realizing this fact, much of the attention has been given to construct a reliable scheme, and many routing protocols have been proposed in order to provide efficient route discoveries between the source and sink. In this chapter, the authors present a review and comparison of different algorithms proposed recently for underwater sensor networks. Later on, all of these have been classified into different groups according to their characteristics and functionalities.
APA, Harvard, Vancouver, ISO, and other styles
8

Sharma, Vishal, and Rakhi Sharma. "Web Switching." In Enterprise Networking. IGI Global, 2002. http://dx.doi.org/10.4018/978-1-930708-17-4.ch006.

Full text
Abstract:
Web switching may be viewed as an optimized combination of networking functions, such as load balancing, bandwidth and traffic management, cache switching, and site-level security, that are implemented on a single device and are specifically designed to address the unique requirements of World Wide Web (or simply, Web) traffic; for example, efficient management of Web traffic, simplified website management, and fast, reliable, and error-free website operation. More precisely, “Web switches are network devices that can be used to construct a ‘user- and content-aware’ network infrastructure, which has the explicit objective of seamless and high-performance routing of specific user requests for specific Web content to the best server containing that content, irrespective of its physical location (Johnson, 1999a).” A web switch, therefore, is an extremely fast and “intelligent” LAN switch that switches traffic based on content, rather than just addresses (Passmore, 1999), and integrates the traffic management and control functions that have traditionally run on a number of separate devices. These include sophisticated URL load balancing capabilities via local and global server load balancing, bandwidth control, network address translation (NAT), packet filtering, cache redirection, and policies to manage and speed the flow of web traffic.
APA, Harvard, Vancouver, ISO, and other styles
9

Kaur, J., and S. Kaur. "A Survey of Efficient Trust Management Schemes in Mobile Ad-Hoc Network." In Research Anthology on Securing Mobile Technologies and Applications. IGI Global, 2021. http://dx.doi.org/10.4018/978-1-7998-8545-0.ch009.

Full text
Abstract:
Mobile Ad Hoc Networks (MANETs) are comprised of an arrangement of self-sorting mobile hosts furnished with wireless interaction devices gathered in groups without the need of any settled framework as well as centralized organization to maintain a system over radio connections. Every mobile node can react as a host and also, the router freely utilizes the wireless medium inside the correspondence range to deal with the interaction between huge quantities of individual mobile nodes by framing a correspondence system and trading the information among them without using any described group of the base station. A trust-based model in MANET estimates and sets up trust relationship among objectives. Trust-based routing is utilized to keep away data from different attackers like a wormhole, DOS, black-hole, selfish attack and so forth. Trust can be executed in different steps like reputation, subjective rationale and from the supposition of the neighboring node. A trust estimation approach not just watches the behavior of neighbor nodes, additionally it screens the transmission of the information packet in the identification of the route for exact estimation of trust value. A survey is carried out to find some of the limitations behind the existing works which has been done by the researchers to implement various approaches thus to build the trust management framework. Through the survey, it is observed that existing works focused only on the authenticated transmission of the message, how it transmits packets to the destination node securely using a trust-based scheme. And also, it is observed that the routing approach only focused on the key management issues. Certain limitation observed in the implemented approaches of existing work loses the reliability of framework. Thus, to withstand these issues it is necessary to establish a reliable security framework that protects the information exchanged among the users in a network while detecting various misbehaving attacks among the users. Confidentiality, as well as the integrity of information, can be secured by combining context-aware access control with trust management. The performance parameters should be evaluated with the previous works packet delivery ratio, packet drop, detection accuracy, number of false positives, and overhead.
APA, Harvard, Vancouver, ISO, and other styles
10

Prusty, Alok R., Srinivas Sethi, and Ajit Kumar Nayak. "Energy Aware Optimized Routing Protocols for Wireless Ad Hoc Sensor Network." In Sensor Technology. IGI Global, 2020. http://dx.doi.org/10.4018/978-1-7998-2454-1.ch070.

Full text
Abstract:
Advancement in wireless technology made human life become simple and easy going. Wireless Ad Hoc Sensor Network (WASN) is one of the friendly wireless networks used to monitor the most unfriendly and ever changing dynamic environment that restricts continuous human attention. WASN has drawn significant attentions due to its unique capabilities to deal with complex network operation in highly resource constrained network construct. This ad hoc and unstructured deployment of tiny sensor nodes operate with controlled transmission range, processing capabilities, as well as very limited battery backup. The severe power depletion affects the existence of active nodes. Hence, data forwarding and reliable packet routing in such phenomenon oriented network becoming a challenge. In this chapter the clustering and hierarchical routing approaches for WASN environment has been briefly presented followed by some optimization strategies applicable to cluster routing process. This chapter can help researchers to think fresh dimensions of ongoing research in WASN cluster routing.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Reliable-aware Routing"

1

Nobakht, Nasrin, Saeed Sedighian Kashi, and Saadan Zokaei. "A Reliable and Delay-Aware Routing in RPL." In 2019 5th Conference on Knowledge Based Engineering and Innovation (KBEI). IEEE, 2019. http://dx.doi.org/10.1109/kbei.2019.8734996.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zhu Rusheng and Liu Fang. "REliable energy aware routing protocol in wireless sensor networks." In 2011 International Conference on Management Science and Industrial Engineering (MSIE). IEEE, 2011. http://dx.doi.org/10.1109/msie.2011.5707608.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Song, Hua, and Xiaola Lin. "Spectrum aware highly reliable routing in multihop cognitive radio networks." In Signal Processing (WCSP 2009). IEEE, 2009. http://dx.doi.org/10.1109/wcsp.2009.5371702.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Xie, Fang, Lei Du, Yong Bai, and Lan Chen. "Energy Aware Reliable Routing Protocol for Mobile Ad Hoc Networks." In 2007 IEEE Wireless Communications and Networking Conference. IEEE, 2007. http://dx.doi.org/10.1109/wcnc.2007.787.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Shin, Kee-Young, Junkeun Song, JinWon Kim, Misun Yu, and Pyeong Soo Mah. "REAR: Reliable Energy Aware Routing Protocol for Wireless Sensor Networks." In The 9th International Conference on Advanced Communication Technology. IEEE, 2007. http://dx.doi.org/10.1109/icact.2007.358410.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Aswale, Shailendra, and Vijay R. Ghorpade. "Reliable and energy-aware routing in Wireless Multimedia Sensor Network." In 2017 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET). IEEE, 2017. http://dx.doi.org/10.1109/wispnet.2017.8299990.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Balasuriya, Nuwan. "A power-aware reliable routing Algorithm for wireless sensor networks." In 2015 10th Asia-Pacific Symposium on Information and Telecommunication Technologies (APSITT). IEEE, 2015. http://dx.doi.org/10.1109/apsitt.2015.7217108.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Tsai, Jack W., and Tim Moors. "Interference-aware Multipath Selection for Reliable Routing in Wireless Mesh Networks." In 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems. IEEE, 2007. http://dx.doi.org/10.1109/mobhoc.2007.4428723.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ya, Li, Wang Pengjun, Luo Rong, Yang Huazhong, and Liu Wei. "Reliable energy-aware routing protocol for heterogeneous WSN based on beaconing." In 2014 16th International Conference on Advanced Communication Technology (ICACT). Global IT Research Institute (GIRI), 2014. http://dx.doi.org/10.1109/icact.2014.6778931.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Sataraddi, Mamata J., and Mahabaleshwar S. Kakkasageri. "Connectivity and Delay Aware Reliable Routing in Vehicular Ad hoc Networks." In 2019 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS). IEEE, 2019. http://dx.doi.org/10.1109/ants47819.2019.9117968.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Reliable-aware Routing' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography