End Packet Research Articles

A Novel Buffer Packet Delivery Strategy for High Throughput and Better Health (HTBH) Method in Wireless Sensor Networks

There is massive call for the Packet Sender Device Network (PSDN) primarily based on tracking of areas, figuring out the consequences of climate, detection of enemy vehicles. The PSDN could have useful Packet Sender Devices (PSD’s) which can study the vicinity and then send the data from initial to receiver PSD. There are numerous constraints which have restrictions on the feature like battery, memory, and range. There is hierarchical community wherein the PSDs are spread on more than one area with every vicinity having their very own PSD’s whilst communique has to manifest among PSDs of various areas then it requires chief PSD in every vicinity which have to be elected primarily based on higher battery degree, distance to base station in addition to mobility of the PSD over a duration of time. LEACH suffers from side-to-side propagation among base station and PSDs. LEACH elects the pinnacle PSD primarily based on random possibility which has consequences of Good-Bad Ratio due to the fact there are possibilities that the PSD with low battery degree be selected as a head PSD. The proposed (HTBH) method will select the head PSD based on battery level, distance between base station and PSD, the mobility of PSD. In order to deliver the data to the processing lab PSDs of the area along with head PSD are used. The packets are classified into high and low priority so that preferences can be used during the data delivery process. Along with sending the current data packets even the data packets reside within the PSD which have to send towards the processing centre. Two policies namely single threshold and dual threshold are used to evict the packets within the PSD and then moving them towards processing centre. This study proposes a higher choice of head PSD with the aid of using considering computation of element which takes into consideration battery, distance, and mobility. The communique among the detection vicinity to receiver vicinity takes place with the assist of PSD’s and head PSD there with the aid of using decreasing range of hops. HTBH method is compared to LEACH and E-LEACH with respect various performance parameters.

Gift Contagion in Online Groups: Evidence from Virtual Red Packets

Gifts are important instruments for forming bonds in interpersonal relationships. Our study analyzes the phenomenon of gift contagion in online groups. Gift contagion encourages social bonds by prompting further gifts; it may also promote group interaction and solidarity. Using data on 36 million online red packet gifts on a large social site in East Asia, we leverage a natural experimental design to identify the social contagion of gift giving in online groups. Our natural experiment is enabled by the randomization of the gift amount allocation algorithm on the platform, which addresses the common challenge of causal identification in observational data. Our study provides evidence of gift contagion: On average, receiving one additional dollar causes a recipient to send 18 cents back to the group within the subsequent 24 hours. Decomposing this effect, we find that it is mainly driven by the extensive margin: more recipients are triggered to send red packets. Moreover, we find that this effect is stronger for “luckiest draw” recipients, suggesting the presence of a group norm regarding the next red packet sender. Finally, we investigate the moderating effects of group- and individual-level social network characteristics on gift contagion as well as the causal impact of receiving gifts on group network structure. Our study has implications for promoting group dynamics and designing marketing strategies for product adoption. This paper was accepted by Axel Ockenfels, behavioral economics and decision analysis. Funding: T. Liu was supported by Natural Science Foundation of China [Grant 72222005] and Tsinghua University [Grant 2022Z04W01032]. J. Tang was supported by Natural Science Foundation of China for Distinguished Young Scholar [Grant 61825602]. Supplemental Material: The data files and online appendices are available at https://doi.org/10.1287/mnsc.2023.4906 .

Performance Investigation of IP Security Virtual Private Network in Ipv6 Environment using Quality of Service

Different types of data are transmitted through the internet, these data such as Email, HTTP, FTP and VoIP conversation might contain important and sensitive information which can be read or seen by other users. Many attacks such as man in the middle, packet sniffing and phishing are available and used by many attackers, as a way to access the protected information. Based on this fact, security and privacy become a necessity in the field of private network (intranet) and public network (extranet). IP sec VPN is considered to be the strongest technique for protecting packets from any kind of attack. In this paper, an analytical study is accomplished using opnet simulation software to design and analyze the proposed network. The proposed network represents four sites in different cities are communicating using the technique of IPsec VPN, different scenarios are created and studied to investigate the performance of network using IPsec VPN in IPV6 environment with QoS. The investigated metrics were packet end to end delay, jitter, packet delay variation, download and upload response time.

Improving QoS in Internet of Vehicles Integrating Swarm Intelligence Guided Topology Adaptive Routing and Service Differentiated Flow Control

Internet of Vehicles (IoV) is an evolution of vehicular adhoc network with concepts of internet of things (IOT). Each vehicle in IOV is an intelligent object with various capabilities like sensors, computation, storage, control etc. Vehicles can connect to any other entity in the network using various services like DSRC, C2C-CC etc. Ensuring QoS for vehicle to everything (V2X) communication is a major challenge in IoV. This work applies an integration of hybrid metaheuristics guided routing and service differentiated flow control to ensure QoS in Internet of Vehicles. Clustering based network topology is adopted with clustering based on hybrid metaheuristics integrating particle swarm optimization with firefly algorithm. Over the established clusters routing decision is done using swarm intelligence. Packet flows in the network are service differentiated and flow control is done at cluster heads to reduce the congestion in the network. High congestion in routes is mitigated with back up path satisfying the QoS constraints. Due to optimization in clustering, routing and data forwarding process, the proposed solution is able to achieve higher QoS. Through simulation analysis, the proposed solution is able to achieve 2% higher packet delivery ratio and 9.67% lower end to end packet latency compared to existing works.

Improving Quality Indicators of the Cloud-Based IoT Networks Using an Improved Form of Seagull Optimization Algorithm

The Internet of things (IoT) points to billions of devices located worldwide which are connected and share their data based on the Internet. Due to the new technologies that provide cheap computer chips and universal wireless networks, it is feasible that everything from a small tablet to a very large airplane will be connected to the Internet and will be a part of the IoT. In most applications, IoT network nodes face limitations in terms of energy source and cost. Therefore, the need for innovative methods to improve quality indicators that increase the lifespan of networks is evident. Here, a novel technique is presented to increase the quality of service (QoS) in IoT using an improved meta-heuristic algorithm, called the improved seagull optimization algorithm (ISOA), along with traffic management in these networks. Based on this subject, the traffic-aware algorithm can manage the sending of packets and increase the QoS provision in terms of time to a great extent. The performance evaluation of the proposed method and comparison with the previous methods demonstrated the accuracy and efficiency of this method and its superiority over the previous works.

SIMULATION OF WIRELESS ESTIMATION BANDWIDTH FOR NETWORK TECHNOLOGY

Wireless estimation bandwidth is used in path selection for a network environment. To access the internet, a typical user shares the same bandwidth that has been provided by the Internet Service Provider (ISP). The scenario worsens when a few of the users access multimedia content on the Internet which requires high bandwidth at the same time. This research could be enhanced in other different network environments, such as wired and mobile phone environments, and represents an analysis of ready bandwidth using a few wireless bandwidth estimation tools, which are WBest, Pathload, IGI MRTG, PRTG and PTR. This paper attempts to design and develop a detection mechanism for wireless estimation bandwidth to estimate an available bandwidththrough several sending of injection traffic packets to the server. In this paper, we measured available bandwidth with WBest. Then we analysed the estimation measurements prior to 2 simulations done on Wireless Mode 11 Mbps 802.11b and Wireless Mode 54 Mbps 802.11g. Three different percentages of packet injection (0%, 25%, 50%) were tested on Wireless Mode 54 Mbps 802.11g. The results accuracy shows that the 50% packet injection performs the least available bandwidth compared to the injection of 0% and 25% of packets.

An Identity-Based Encryption Method for SDN-Enabled Source Routing Systems

In this study, we consider endpoints communicating over a software-defined networking (SDN)-based architecture using source routing, i.e., packets are routed through a path selected by the packet sender, and we provide a security solution that enforces the selected path. In particular, our solution allows a sender to select the path that a packet should go through using a constant-size cryptographic construction which is referred to as the authenticator. A recipient can examine an authenticator and verify that the received packet has followed the path selected by the sender. Additionally, any intermediate “programmable” switch can verify whether or not it is included in the path of a packet. Our solution can be used even for paths that include multiple recipients (e.g., multicast paths), as well as multiple parallel paths (e.g., multipath transmissions). We implement our solution by leveraging identity-based encryption (IBE), so it can be used by any sender that knows the identifiers of the links that compose the desired path, i.e., information that the sender usually already knows as part of the source routing protocol. Our solution is realistic since it can be implemented over a variety of platforms with tolerable overhead.

Performance Evaluation of routing protocols with and without malicious nodes

Vehicular adhoc networks (VANETs) are made by applying the standards of mobile adhoc networks (MANETs)-the unconstrained making of a remote network of cell phones to the area of vehicles. VANETs were first referenced and presented in 2001 under ”vehicle to-vehicle specially appointed versatile correspondence and systems administration” applications, where networks can be shaped and data can be handed-off among vehicles. It was shown that vehicle-to- vehicle and vehicle-to-road side exchange designs will exist together in VANETs to give street security, route, and other side of the road administrations. VANETs are a vital piece of the intelligent transportation frameworks (ITS) system. At times, VANETs are known as Intelligent Transport Networks. They are perceived as having advanced into a more extensive “Web of vehicles”. Which itself is relied upon to eventually advance into a “Web of self-sufficient vehicles”. The vehicles send some data about street status and traffic. But sometimes the information send from one vehicle to another can be malicious. This malicious information is added by the intruders to cause problem in vehicular network so that accident can occur. In this report, we will analyse the throughput, packet delivery ratio and end to end delay in sending information from vehicle to vehicle when the network is attacked by some malicious nodes.

Secure Optimized Request Zone Location-Aided Routing

Secure data transmission is one of the biggest challenges for Vehicular Ad Hoc Networks (VANETs) due to its dynamic and infrastructure-less characteristics. Such security services become a demand to provide safe and secure conversation between automobiles. In this paper, two optimized secure routing protocol for VANETs were proposed: 1) Secure Tilted-Rectangular-Shaped Request Zone Location-Aided Routing protocol (STRS-RZLAR); 2) Secure Cone-Shaped Request Zone LAR (SCS-RZLAR). Each proposed secure protocol integrates a security unit with an optimized shape request zone. The security unit in both protocols is a multi-layer unit that adopts two security agreement protocols: 1) modified Diffie-Hellman key agreement protocol; 2) short authentication string (SAS)-based key agreement protocol. The overall communication scheme is performed using Wi-Fi Direct out-of-band channels. The proposed secure protocols provide a reliable and secure data transmission between automobiles in a VANET and thus making it robust against man-in-the-middle attack (MITMA). Extensive simulations using three main network parameters: vehicular node density, number of malicious nodes and vehicle speed show that the proposed secure routing protocols provide superior performance regarding data delivery and normalized routing load (NRL) with a trade-off in average end to end packet delay. From the other side, Simulation results show that SCS-RZLAR protocol outperforms the STRS-RZLAR protocol regarding NRL and average end to end packet delay, while STRS-RZLAR protocol outperforms the SCS-RZLAR protocol regarding data delivery.

Data transfer in the mathematical broken symmetry group model

The article shows a mathematical description of data transfer using a directed graph, as well as an algorithm for data transport in a network based on the multiplication tables of substitutions – elements of the broken symmetry group. It was analyzed how many steps are necessary when data transmission in systems with alternate sending of data packets. Using multiplication tables of substitutions the possibility of calculating the graph trees with nested nodes was demonstrated, including PQ-trees. The article provides examples of models for collecting information in two main network nodes, as well as networks with a more complex topology, for example the tree with its “rootstock”.

An Algorithmic Approach to Identify the Optimum Network Architecture and WLAN Protocol for VoIP Application

To determine the optimal network architecture between the Basic Service Set, the Extended Service Set and the Independent Basic Service Set, this study established a new algorithm to assess Voice over Internet Protocol (VoIP) metrics of different IEEE 802.11 technologies. An important coefficient for each VoIP metric parameter has been invented to rank the different IEEE 802.11 standards and to identify the most efficient one for the VoIP application. The best overall network performance that offers good voice quality is ensured by determining the optimum network architecture and technology. Moreover, for the VoIP efficiency parameters, it meets the acceptance threshold values. This algorithm was implemented in different sizes of rooms ranging from 1 × 1 m to 10 × 10 m, and the number of nodes varied from 1 to 65. End to end delay, jitter, throughput and packet loss were the quality of service parameters used.

How to limit capacity of timing covert channel by adding extra delays

Covert channel is a communication channel that was not designed for information transmission. It is proven that in some circumstances the attacker has an ability to build a covert channel that cannot be detected. That is why the method of capacity limitation of a potential covert channel seems to be an effective counteraction that can be used when allowable level of covert channel capacity is set up. To use such method, it is needed to estimate residual covert channel capacity. Random delays before packet sending are considered as a tool of noise insertion into a covert channel. In this paper authors investigated the way to estimate covert channel capacity taking into account network load conditions. The main topics of the research are cases when time intervals between packet sending and packet receiving in network comply with normal and exponential distributions.

Robust and secure authentication protocol protecting privacy for roaming mobile user in global mobility networks

With the advent of new 5G technology there is a need to develop security architecture. Two factor authentication schemes are developed to address the security features such as user anonymity and privacy preservation during roaming scenario in GLObal Mobility NETwork. The entire communication during roaming is carried over insecure channel and owing to this, security concern is raised. The main objective of the proposed protocol is to secure the channel and to overcome all active and passive security attacks. The proposed protocol addresses the active and passive security attacks that exist in 5G cellular networks which are formally verified using AVISPA tool. The proposed protocol is simulated using NS2.35 simulator and the performance metrics such as throughput, end to end delivery and packet delivery ratio are computed. The protocol is efficient in terms of computational and communication cost. The proposed scheme is robust and practically implementable.

Gift Contagion in Online Groups: Evidence From WeChat Red Packets

Gifts are important instruments for forming bonds in interpersonal relationships. Our study analyzes the phenomenon of gift contagion in online groups. Gift contagion encourages social bonds of prompting further gifts; it may also promote group interaction and solidarity. Using data on 36 million online red packet gifts on China's social site WeChat, we leverage a natural experimental design to identify the social contagion of gift giving in online groups. Our natural experiment is enabled by the randomization of the gift amount allocation algorithm on WeChat, which addresses the common challenge of causal identifications in observational data. Our study provides evidence of gift contagion: on average, receiving one additional dollar causes a recipient to send 18 cents back to the group within the subsequent 24 hours. Decomposing this effect, we find that it is mainly driven by the extensive margin -- more recipients are triggered to send red packets. Moreover, we find that this effect is stronger for luckiest draw recipients, suggesting the presence of a group norm regarding the next red packet sender. Finally, we investigate the moderating effects of group- and individual-level social network characteristics on gift contagion as well as the causal impact of receiving gifts on group network structure. Our study has implications for promoting group dynamics and designing marketing strategies for product adoption.

Ефективність нового екранування крайніх пакетів осердя статора потужного турбогенератора

On the basis of complex research the electromagnetic and heat processes by means of mathematical and physical simulation, the efficiency for a new constructive solution of stator core end zone of powerful turbogenerator is proved. A design that allows maximum reducing temperature of the stator end packet is proposed. In order to increase reliability of experimental data obtained with the help of scale physical model, as well as testing of constructed mathematical model, using the latest one “adjusted” to physical model, the numerous experiments for studying effectiveness of a tooth-slot configuration shields were carried out. The small difference of magnetic flux density values obtained by means of mathematical simulation from the experimental ones allows drawing a conclusion about the reliability of result. It is shown that use of physical simulation permits investigate the appropriateness of electromagnetic field distribution without exact quantitative indices of parameters and can be applied to research the quality comparison under certain changes of model. When constructing a mathematical model, an approach was used with the help of a consecutive logic transition from a simple model of machine central part to more difficult one of end zone, using the previous results in next allows obtaining the temperature distribution in difficult areas. The heat calculation for rated load condition of turbogenerator type TGV-500 with the help of mathematical model as well as comparison of these results with experimental data for a real generator analogous type and power are made. The differences of calculated and experimental values not exceed 7%. All data obtained by means of both simulation and natural experiment are corresponded to the same turbogenerator that in total makes reliability results of mathematical simulation not obtained in a real object by various reasons of objective and subjective nature.

NDN Fabric: Where the Software-Defined Networking Meets the Content-Centric Model

Named Data Networking (NDN) is a new network architecture based on the content-based model that has fundamental differences to the legacy path-based model. The first is focused on the content itself, and the latter focuses on the location of data. Both models provide different benefits to the end-user and the network, but they often cannot inter-operate due to their significant design differences. Therefore, we propose a new network architecture and protocol, both named NDN-Fab, to allow the inter-operation between path-based and content-based network architectures. NDN-Fab is based on the Fabric model and allows the edge network to operate with content-centric architectures, such as the NDN, while the core network can operate with a high-performance path-based communication model. The Core network uses the NDN-Fab protocol that can be embedded in the programmable data plane hardware of the core network’s switches, allowing for the sending of multicast packets and link-layer packet steering. Our results show that NDN-Fab can be more efficient in packet forwarding than IPv4, achieving up to 150 times lower average delay, 100 times lower network dispersion, and it managed to process 21% more packets.

Использование статистических методов для анализа и прогноза udp-flood атак

Web resources are an integral part of the life of a modern person, who are now more and more often subjected to hacker attacks. The most popular types of attacks are the SQL-injections and cross-site scripting, but DDoS attacks continue to be in the top 10 of network attacks and lead to serious crashes and failures of web resources. The most common type of DDoS attack is UDP flood attack, based on the infinite sending of UDP packets to ports of various UDP services. The scientific novelty of the work lies in the fact that to increase the level of security of web resources a medium-term forecast of cyber attacks of the UDP-flood type, using the methods of correlation analysis, based on the additive time series model, is proposed taking into account seasonal factors and time duration, which will ensure the necessary level of web security -resources. The type of UDP-flood attacks was chosen as the object of study. Using the methods of correlation analysis and modeling, we calculated the seasonal index of UDP flood attacks, and the autocorrelation of the time series of this type of attack. Using the method of simple exponential smoothing, a forecast of UDP-flood attacks is constructed. The paper proposes a classification of DDoS attacks, describes protection methods. Based on the correlation analysis, the predicted values of the impact of UDP flood attacks on web resources are calculated, and the seasonal factor is revealed. The largest number of attacks is expected in the IV quarter of 2020. For DDoS attacks lasting up to 20 minutes, seasonality was also revealed in the 1st quarter of the calendar year, which means that in the 1st quarter of 2020 the largest number of attacks of this duration should be expected. Prospects for further research into the problem of protection against DDoS attacks are presented in the further development of the methodology for countering UDP flood attacks and information security algorithms for web resources, which will reduce the number of UDP flood attacks and increase the level of web resource security.

Performance Assessment of QoS Using AODV, TORA and ZRP Routing Protocol in MANET

In Mobile Ad hoc Networks (MANET) nodes often change their location independently where neither fixed nor centralized infrastructure is present. Nodes communicate with each other directly or via intermediate nodes. The advantages of the MANET layout lead to self-structure and compatibility to most important functions such as traffic distribution and load balancing. Whenever the host moves rapidly in the network the topology becomes updated due to which the structure of MANET varies accordingly. In the literature, different routing protocols have been studied and compared by researchers. Still, there are queries regarding the performance of these protocols under different scenarios. MANETs are not based on a predesigned structure. In this paper, the performance assessment of the Quality of Services (QoS) for different protocols such as Ad hoc On-Demand Distance Vector (AODV), Temporally Ordered Routing Algorithm (TORA) and Zone Routing Protocol (ZRP) in the existence of the various number of communicating nodes is studied. The performance matrices throughput, end – to – end delay and packet delivery ratio are considered for simulations. Ns 2.35 simulator is used for carrying out these simulations. Results are compared for AODV, TORA, and ZRP routing protocols. The results show that AODV and TORA perform well in end – to – end delay as compared to zone routing protocol. Zone routing protocol performs well in packet delivery ratio and throughput as compared to both the other protocols.

Application of statistical methods for predicting udp-flood attacks

Aim . Web resources are an integral part of modern human life. Today, these resources are increasingly exposed to hacker attacks, such as the introduction of SQL operators, crosssite scripting, etc. DDoS attacks continue to be included in the top 10 network attacks that lead to serious failures of web resources. The most common type of DDoS attack is UDP-flood attacks based on the endless sending of UDP packets to the ports of various UDP services. Our empirical study was based on the following factors: the lack of effective means of protection against DDoS attacks, the specificity of UDP-flood attacks, and the lack of prediction models that adequately describe the process under study. The aim of this study was to increase the level of security of web resources by means of timely detection of anomalies in their work, detection of information security threats based on analysis and forecasting methods. The research object was UDP-flood attacks. Methods . Correlation analysis and modelling methods were used to calculate the seasonal index of UDP-flood attacks and the autocorrelation of the time series of this type of attack. The forecast of UDP-flood attacks was built based on simple exponential smoothing and neural network forecasting models. Results . A classification of DDoS attacks was proposed, along with possible protection approaches. Using a correlation analysis, the forecast values of the impact of UDP-flood attacks against web resources were calculated, and the seasonal factor was identified. The analysis of the forecast results showed that the spread of forecast values was not significant; the largest number of attacks is expected in the fourth quarter of 2020. For DDoS attacks lasting up to 20 minutes, seasonality was also detected in the first quarter of the calendar year, which means that the largest number of attacks of this duration should be expected in the first quarter of 2020. Conclusion . In order to improve the level of protection against DDoS attacks, further research should be aimed at developing methods for combating UDP-flood attacks and algorithms increasing the information security of web resources, as well as implementing measures to improve the security of web-based resources.

Countermeasures against darknet localisation attacks with packet sampling

<p>The darknet monitoring system consists of network sensors widely deployed on the Internet to capture incoming unsolicited packets. A goal of this system is to analyse captured malicious packets and provide effective information to protect regular nonmalicious Internet users from malicious activities. To provide effective and reliable information, the location of sensors must be concealed. However, attackers launch localisation attacks to detect sensors in order to evade them. If the actual location of sensors is revealed, it is almost impossible to identify the latest tactics used by attackers. Thus, in a previous study, we proposed a packet sampling method, which samples incoming packets based on an attribute of the packet sender, to increase tolerance to a localisation attack and maintain the quality of information publicised by the system. We were successful in countering localisation attacks, which generate spikes on the publicised graph to detect a sensor. However, in some cases, with the previously proposed sampling method, spikes were clearly evident on the graph. Therefore, in this paper, we propose advanced sampling methods such that incoming packets are sampled based on multiple attributes of the packet sender. We present our improved methods and show promising evaluation results obtained via a simulation.</p>