نتایج جستجو برای: opportunistic routing

تعداد نتایج: 73783  

Journal: :Journal of Sensor and Actuator Networks 2022

Opportunistic networks are an enabler technology for typologies without centralized infrastructure. Portable devices, such as wearable and embedded mobile systems, send relay messages to the communication range devices. One of most critical challenges is find optimal route in these while at same time preserving privacy participants network. Addressing this challenge, we presented a novel routin...

2013
Kanchan Hadawale Sunita Barve

Cognitive Radio (CR) technology is introduced to solve the problem of spectrum usage inefficiency of wireless networks. CR technology allows sharing of licensed spectrum band in opportunistic and non interfering manner. However it should be aware of spectrum availability and Primary User (PU) activities. Routing and spectrum management are the main challenges in Cognitive Radio Network. Here ro...

Journal: :International Journal of Future Generation Communication and Networking 2015

Journal: :EURASIP Journal on Wireless Communications and Networking 2009

Journal: :International Journal of Ad hoc, Sensor & Ubiquitous Computing 2017

Journal: :Comput. J. 2010
François Baccelli Bartlomiej Blaszczyszyn Paul Mühlethaler

In classical routing strategies for wireless adhoc (mobile or mesh) networks packets are transmitted on a pre-defined route that is usually obtained by a shortest path routing protocol. In this paper we review some recent ideas concerning a new routing technique which is opportunistic in the sense that each packet at each hop on its (specific) route from an origin to a destination takes advanta...

2014
Karunakar Reddy

Traditional routing strategies for multi-hop wireless networks forward packets by selecting at the sender side the next hop for each packet. We consider the problem of routing packets across a multi-hop network consisting of multiple sources of traffic and wireless links while ensuring bounded expected delay. Each packet transmission can be overheard by a random subset of receiver nodes among w...

2016
Fan Wang Yan Yang Kunpeng Wang Xiaopeng Hu Ning Zhang

Based on the analysis of the existing classic clustering routing algorithm HEED, this paper proposes an efficient dynamic clustering routing algorithm ED-HEED. In the cluster selection process, in order to optimize the network topology and select more proper nodes as the cluster head, the proposed clustering algorithm considers the shortest path prediction of the node to the destination sink an...

2013
K. Sudha R. Rathipriya

Present new mechanisms for modelling multiple interfaces on a node, support for interference-limited links and a framework for modelling complex applications running on the nodes. Furthermore, provide an overview of concrete use cases where the simulator has been successfully exploited to study a variety of aspects related to opportunistic, message-based communications. Node movement is impleme...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید