9783659908040 - Effective & Efficient Routing Protocol for Multi-hop Wireless Networks von Das, Debasis; Kumar, Amritesh; Das, Subhasis (6 Ergebnisse)

Paperback. Zustand: Brand New. 84 pages. 8.66x5.91x0.19 inches. In Stock.

Taschenbuch. Zustand: Neu. Effective & Efficient Routing Protocol for Multi-hop Wireless Networks | Debasis Das (u. a.) | Taschenbuch | 84 S. | Englisch | 2016 | LAP LAMBERT Academic Publishing | EAN 9783659908040 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.

Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Opportunistic Routing (OR) is a new encouraging routing technique that is an efficient and enhanced routing scheme for wireless networks. It is an approach which takes a certain number of best forwarder nodes (i.e., candidate nodes) at each hop by taking the advantage of the broadcast nature of the wireless networks to reach the destination from the source node. When a lot of candidate nodes receive the package from the source node, they coordinate with each other to compute out which one node has to forward the packet toward the destination from the intermediate nodes. In our proposed approach, we deal with the node mobility means the dynamic nature of mobile nodes and a performance metric which considers the geographical location of the candidate nodes, at least one candidate node must be transfer the data packet, no candidate will receives the duplicate packet, the link delivery probability between the nodes, the number of the neighboring nodes of the candidate, and the predicted geographical position of nodes. 84 pp. Englisch.

Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Das DebasisDr. Debasis Das is an Assistant Professor in Computer Science and Engineering Department at NIIT University, Neemrana, Rajasthan, India. He received his Ph.D from Department of Computer Science and Engineering, Indian Inst.

Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Opportunistic Routing (OR) is a new encouraging routing technique that is an efficient and enhanced routing scheme for wireless networks. It is an approach which takes a certain number of best forwarder nodes (i.e., candidate nodes) at each hop by taking the advantage of the broadcast nature of the wireless networks to reach the destination from the source node. When a lot of candidate nodes receive the package from the source node, they coordinate with each other to compute out which one node has to forward the packet toward the destination from the intermediate nodes. In our proposed approach, we deal with the node mobility means the dynamic nature of mobile nodes and a performance metric which considers the geographical location of the candidate nodes, at least one candidate node must be transfer the data packet, no candidate will receives the duplicate packet, the link delivery probability between the nodes, the number of the neighboring nodes of the candidate, and the predicted geographical position of nodes.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 84 pp. Englisch.

Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Opportunistic Routing (OR) is a new encouraging routing technique that is an efficient and enhanced routing scheme for wireless networks. It is an approach which takes a certain number of best forwarder nodes (i.e., candidate nodes) at each hop by taking the advantage of the broadcast nature of the wireless networks to reach the destination from the source node. When a lot of candidate nodes receive the package from the source node, they coordinate with each other to compute out which one node has to forward the packet toward the destination from the intermediate nodes. In our proposed approach, we deal with the node mobility means the dynamic nature of mobile nodes and a performance metric which considers the geographical location of the candidate nodes, at least one candidate node must be transfer the data packet, no candidate will receives the duplicate packet, the link delivery probability between the nodes, the number of the neighboring nodes of the candidate, and the predicted geographical position of nodes.