The Experts below are selected from a list of 1314 Experts worldwide ranked by ideXlab platform
Das, Sajal K. - One of the best experts on this subject based on the ideXlab platform.
-
Overhead Control with Reliable Transmission of Popular Packets in Ad-Hoc Social Networks
'Institute of Electrical and Electronics Engineers (IEEE)', 2020Co-Authors: Xia Feng, Liaqat, Hannan Bin, Deng Jing, Wan Jiafu, Das, Sajal K.Abstract:Reliable social connectivity and transmission of data for popular nodes is vital in multihop Ad-hoc Social Networks (ASNETs). In this networking paradigm, transmission unreliability could be caused by multiple social applications running on a single node. This leads to contentions among nodes and connection paths. In addition, congestions can be the result of multiple senders transmitting data to a single receiver and every sender waiting for a positive Acknowledgment to move on. Therefore, traditional Transmission Control Protocol (TCP) performs poorly in ASNETs, due to the fact that the available bandwidth is shared among nodes using round trip time and the Acknowledgment is provided individually to every data Packet. To solve these issues, we propose a technique, called Overhead Control with Reliable Transmission of Popular Packets in Ad-Hoc Social Networks (RTPS), which improves transmission reliability by assigning bandwidth to users based on their popularity levels: extra bandwidth is assigned to the nodes with higher popularity and their Acknowledgments are sent with higher priority. In addition, RTPS further reduces contentions and Packet losses by delaying Acknowledgment Packet transmissions. Our detailed investigations demonstrate the excellent performance of RTPS in terms of throughput latency and overhead with different hop-distances and different numbers of concurrent TCP flows.Comment: 14 pages, 8 figure
-
Overhead Control with Reliable Transmission of Popular Packets in Ad-Hoc Social Networks
'Institute of Electrical and Electronics Engineers (IEEE)', 2016Co-Authors: Xia Feng, Liaqat, Hannan Bin, Deng Jing, Wan Jiafu, Das, Sajal K.Abstract:Reliable social connectivity and transmission of data for popular nodes is vital in multihop ad-hoc social networks (ASNETs). In this networking paradigm, transmission unreliability could be caused by multiple social applications running on a single node. This leads to contentions among nodes and connection paths. In addition, congestion can be the result of multiple senders transmitting data to a single receiver and every sender waiting for a positive Acknowledgment to move on. Therefore, the traditional Transmission Control Protocol (TCP) performs poorly in ASNETs because the available bandwidth is shared among nodes using round-trip time, and the Acknowledgment is provided individually to every data Packet. To solve these issues, we propose a technique called Overhead Control with Reliable Transmission of Popular Packets in Ad-Hoc Social Networks (RTPS), which improves transmission reliability by assigning bandwidth to users based on their popularity levels: Extra bandwidth is assigned to the nodes with higher popularity, and their Acknowledgments are sent with higher priority. In addition, RTPS further reduces contentions and Packet losses by delaying Acknowledgment Packet transmissions. Our detailed investigations demonstrate the excellent performance of RTPS in terms of throughput latency and overhead with different hop distances and different numbers of concurrent TCP flows
Prof R. K. Krishna - One of the best experts on this subject based on the ideXlab platform.
-
―Routing of Misbehavior Nodes in Manets Using Acknowledgement Method‖
2015Co-Authors: Bhagyashree S. Madan, Prof R. K. KrishnaAbstract:collection of mobile nodes (hosts) which communicate with each other via wireless links either directly or relying on other nodes as routers. The operation of MANETs does not depend on pre-existing infrastructure or base stations. Network nodes in MANETs are free to move randomly. The nodes which drop the information to send forward considered as a selfish Node. Specifically, nodes may participate in the route discovery and maintenance processes but refuse to forward data Packets. To detect such misbehavior and more efficient detection process, the 2ACK technique is analyzed. The main idea of the 2ACK scheme is to send two-hop Acknowledgment Packets in the opposite direction of the routing path. The 2ACK scheme detects misbehavior through the use of a new type of Acknowledgment Packet, termed 2ACK. Thus it detects the misbehaving nodes, eliminate them and choose the other path for transmitting the data. The main aim of this application is to detect the routing misbehavior in Manets that occurs due to the presence of selfish node. The input to the system will be the number of nodes with data transmission between them. The output of the system will involve detecting the misbehaving link and misbehaving node due to which the Packet loss occurs
-
Detection of Misbehavior Nodes in Manets Using 2ACK Method
2015Co-Authors: Bhagyashree S. Madan, Prof R. K. KrishnaAbstract:A Mobile Ad Hoc Network (MANET) is a collection of mobile nodes (hosts) which communicate with each other via wireless links either directly or relying on other nodes as routers. The operation of MANETs does not depend on pre-existing infrastructure or base stations. Network nodes in MANETs are free to move randomly. The nodes which drop the information to send forward considered as a selfish Node. Specifically, nodes may participate in the route discovery and maintenance processes but refuse to forward data Packets. To detect such misbehavior and more efficient detection process, the 2ACK technique is analyzed. The main idea of the 2ACK scheme is to send two-hop Acknowledgment Packets in the opposite direction of the routing path. The 2ACK scheme detects misbehavior through the use of a new type of Acknowledgment Packet, termed 2ACK. Thus it detects the misbehaving nodes, eliminate them and choose the other path for transmitting the data. The main aim of this application is to detect the routing misbehavior in Manets that occurs due to the presence of selfish node. The input to the system will be the number of nodes with data transmission between them. The output of the system will involve detecting the misbehaving link and misbehaving node due to which the Packet loss occurs
Xia Feng - One of the best experts on this subject based on the ideXlab platform.
-
Overhead Control with Reliable Transmission of Popular Packets in Ad-Hoc Social Networks
'Institute of Electrical and Electronics Engineers (IEEE)', 2020Co-Authors: Xia Feng, Liaqat, Hannan Bin, Deng Jing, Wan Jiafu, Das, Sajal K.Abstract:Reliable social connectivity and transmission of data for popular nodes is vital in multihop Ad-hoc Social Networks (ASNETs). In this networking paradigm, transmission unreliability could be caused by multiple social applications running on a single node. This leads to contentions among nodes and connection paths. In addition, congestions can be the result of multiple senders transmitting data to a single receiver and every sender waiting for a positive Acknowledgment to move on. Therefore, traditional Transmission Control Protocol (TCP) performs poorly in ASNETs, due to the fact that the available bandwidth is shared among nodes using round trip time and the Acknowledgment is provided individually to every data Packet. To solve these issues, we propose a technique, called Overhead Control with Reliable Transmission of Popular Packets in Ad-Hoc Social Networks (RTPS), which improves transmission reliability by assigning bandwidth to users based on their popularity levels: extra bandwidth is assigned to the nodes with higher popularity and their Acknowledgments are sent with higher priority. In addition, RTPS further reduces contentions and Packet losses by delaying Acknowledgment Packet transmissions. Our detailed investigations demonstrate the excellent performance of RTPS in terms of throughput latency and overhead with different hop-distances and different numbers of concurrent TCP flows.Comment: 14 pages, 8 figure
-
Overhead Control with Reliable Transmission of Popular Packets in Ad-Hoc Social Networks
'Institute of Electrical and Electronics Engineers (IEEE)', 2016Co-Authors: Xia Feng, Liaqat, Hannan Bin, Deng Jing, Wan Jiafu, Das, Sajal K.Abstract:Reliable social connectivity and transmission of data for popular nodes is vital in multihop ad-hoc social networks (ASNETs). In this networking paradigm, transmission unreliability could be caused by multiple social applications running on a single node. This leads to contentions among nodes and connection paths. In addition, congestion can be the result of multiple senders transmitting data to a single receiver and every sender waiting for a positive Acknowledgment to move on. Therefore, the traditional Transmission Control Protocol (TCP) performs poorly in ASNETs because the available bandwidth is shared among nodes using round-trip time, and the Acknowledgment is provided individually to every data Packet. To solve these issues, we propose a technique called Overhead Control with Reliable Transmission of Popular Packets in Ad-Hoc Social Networks (RTPS), which improves transmission reliability by assigning bandwidth to users based on their popularity levels: Extra bandwidth is assigned to the nodes with higher popularity, and their Acknowledgments are sent with higher priority. In addition, RTPS further reduces contentions and Packet losses by delaying Acknowledgment Packet transmissions. Our detailed investigations demonstrate the excellent performance of RTPS in terms of throughput latency and overhead with different hop distances and different numbers of concurrent TCP flows
Kawadkar Pankaj - One of the best experts on this subject based on the ideXlab platform.
-
“Reducing Packet Loss in MANET”
The International Institute for Science Technology and Education (IISTE), 2013Co-Authors: Sharma Shalini, Gupta Hitesh, Kawadkar PankajAbstract:Dynamic topology and infrastructure less behaviour provide a great facility for adhoc network. Such facility generates easy connection of adhoc network and provides node mobility without loss of connection. In such ability Packet dropping is a serious challenge for quality performance of adhoc network. The adhoc network suffered some serious security therats such attacks are black hole attack, malicious attack and worm hole attack that attack occurred a Packet dropping problem in adhoc network. For the minimization of attack and Packet dropping various authors built various method such method is node authentication, passive feedback scheme, ack-based scheme,reputation based scheme and incentive based scheme, ack-based scheme suffered a problem of massive overhead due to extra Acknowledgment Packet and it also suffered decision ambiguity if the requested node refuse to send back Acknowledgment. In this dissertation we uses modified ack-based scheme using secure channel for overcoming the problem of decision ambiguity for requested node, improved node authentication and minimize Packet dropping in adhoc network. Keywords- mobile ad-hoc network, routing misbehaviour, AODV routing protocol, ACK based approach, network security
-
Migrating Packet Dropping in Mobile Ad-hoc Network Based on Modified ACK-Based Scheme
The International Institute for Science Technology and Education (IISTE), 2013Co-Authors: Sharma Shalini, Gupta Hitesh, Kawadkar PankajAbstract:Dynamic topology and infrastructure less behavior provide a great facility for adhoc network. Such facility generates easy connection of adhoc network and provides node mobility without loss of connection. In such ability Packet dropping is a serious challenge for quality performance of adhoc network. The adhoc network suffered some serious security threats such attacks are black hole attack, malicious attack and worm hole attack that attack occurred a Packet dropping problem in adhoc network. For the minimization of attack and Packet dropping various authors built various method such method is node authentication, passive feedback scheme, ack-based scheme, reputation based scheme and incentive based scheme, ack-based scheme suffered a problem of massive overhead due to extra Acknowledgment Packet and it also suffered decision ambiguity if the requested node refuse to send back Acknowledgment. In this dissertation we uses modified ack-based scheme using secure channel for overcoming the problem of decision ambiguity for requested node, improved node authentication and minimize Packet dropping in adhoc network. Keywords mobile ad-hoc network, routing misbehaviour, AODV routing protocol, ACK based approach, network security
Bhagyashree S. Madan - One of the best experts on this subject based on the ideXlab platform.
-
―Routing of Misbehavior Nodes in Manets Using Acknowledgement Method‖
2015Co-Authors: Bhagyashree S. Madan, Prof R. K. KrishnaAbstract:collection of mobile nodes (hosts) which communicate with each other via wireless links either directly or relying on other nodes as routers. The operation of MANETs does not depend on pre-existing infrastructure or base stations. Network nodes in MANETs are free to move randomly. The nodes which drop the information to send forward considered as a selfish Node. Specifically, nodes may participate in the route discovery and maintenance processes but refuse to forward data Packets. To detect such misbehavior and more efficient detection process, the 2ACK technique is analyzed. The main idea of the 2ACK scheme is to send two-hop Acknowledgment Packets in the opposite direction of the routing path. The 2ACK scheme detects misbehavior through the use of a new type of Acknowledgment Packet, termed 2ACK. Thus it detects the misbehaving nodes, eliminate them and choose the other path for transmitting the data. The main aim of this application is to detect the routing misbehavior in Manets that occurs due to the presence of selfish node. The input to the system will be the number of nodes with data transmission between them. The output of the system will involve detecting the misbehaving link and misbehaving node due to which the Packet loss occurs
-
Detection of Misbehavior Nodes in Manets Using 2ACK Method
2015Co-Authors: Bhagyashree S. Madan, Prof R. K. KrishnaAbstract:A Mobile Ad Hoc Network (MANET) is a collection of mobile nodes (hosts) which communicate with each other via wireless links either directly or relying on other nodes as routers. The operation of MANETs does not depend on pre-existing infrastructure or base stations. Network nodes in MANETs are free to move randomly. The nodes which drop the information to send forward considered as a selfish Node. Specifically, nodes may participate in the route discovery and maintenance processes but refuse to forward data Packets. To detect such misbehavior and more efficient detection process, the 2ACK technique is analyzed. The main idea of the 2ACK scheme is to send two-hop Acknowledgment Packets in the opposite direction of the routing path. The 2ACK scheme detects misbehavior through the use of a new type of Acknowledgment Packet, termed 2ACK. Thus it detects the misbehaving nodes, eliminate them and choose the other path for transmitting the data. The main aim of this application is to detect the routing misbehavior in Manets that occurs due to the presence of selfish node. The input to the system will be the number of nodes with data transmission between them. The output of the system will involve detecting the misbehaving link and misbehaving node due to which the Packet loss occurs
