Earticle

To increase the security of multicast, a Random Tree Multicast (RTM) scheme in reconfigurable network was presented. By decoupling data flow and group management, and by changing the multicast tree and channel with the technology of Moving Target Defense (MTD), RTM can improve the ability of defending eavesdrop and traffic analysis with little complexity. We present the details of our scheme, analyzed its performance, and discussed its advantages over traditional schemes.

Delay and/or Disruption-Tolerant Networking (DTN) is a novel communication prototype that can span across multiple networks and deal with unpredicted conditions in the Internet model. Pocket Switched Networks (PSN) are delay tolerant networks with hand held devices. Nodes in a PSN make use of a store-carry-and-forward paradigm to communicate along with themselves. The routing protocols performances that have been developed for DTN based on the movement pattern of the nodes. We propose a Human Mobility based Spray & Wait Routing protocol (HMSaW). This protocol makes use of truncated power law distribution of pause time and flight length of human mobility to smartly forward data in DTN and PSN. Simulation results show that the proposed HMSaW shows better delivery ratio and the communication overhead, with marginal reduction in average delay compared to existing PROPHET and Spray & Wait Routing protocol.

Recently, social networks have become one of the most popular tools for communication and information exchanges, and people are constructing social relationships and conducting social interactions over social networks. In this paper, we focus on digital forensics on social networks. Specifically, considering the emerging of cloud computing and big data tides, we propose a cloud based forensics framework for social networks, where social networking data is collected, stored, and analyzed through a multi-layered modularity framework using cloud computing techniques, including virtualization, distributed processing and storage, and collaboration. Besides, we also provide a case study on social link prediction, which is, reasoning links between nodes to infer possible relationships between criminals.

Aiming at the division roughness of topic classification existing in the most online social networks community, the improved particle swarm optimization algorithm is applied to refine community topics and concepts of community seeds and community topic are also introduced. In this paper, first of all, the explicit links existing in the community are mined, and the basic community structure is constructed, then the community content is deeply analyzed, according to implicit feature between nodes under online community, community topic categories are elaborately refined until structure is stable. Experiments show that this proposed algorithm can accelerate the convergence of the node and greatly improves the topic mining accuracy of online social network compared with the state-of-art CR2NDAS model and PLSA model.

Energy Efficient in the VoIP transmission is the major criteria and issues to be maintained the packet and data while processing VoIP (QoS) over Manet environment. Mobile Adhoc network (MANETs) presents a good platform for the fast deployment of VoIP services in many application scenarios. The energy efficiency mechanism for the data packet of voice in the queuing system have not been concentrated which actually consumes the more power while in the queue buffer management. Manet provide a considerable complexity that makes the transmission of real-time applications like VoIP a great challenge due to insufficient energy for packet transmission. In this research a new algorithm is proposed which enhance the performance of energy in manet carrying VoIP traffic. Through a simulation and mathematical expression we analyze and evaluate QoS indicators such as Distance, power, Bandwidth. Several voice codec are studied to determine their effect of insufficient energy. In the existing methods queuing energy have been used depend on number of nodes in certain environment which is drawbacks with mobile nodes. Hence a QoS based Intelligent Adaptive Energy Efficiency & Effective signal buffer management algorithm for voip(QoS) over Manet. The main objective of this paper is to segregate the energy altitude as per detachment the bandwidth is assign by using our IAE3 signal barrier algorithm in manet environment. In great and dynamic networks, central algorithms are not suitable due to the lack of responsiveness. The bandwidth allocation is done by IAE3 signal buffer algorithm.

In this paper, a six-dimensional Lie algebra is first introduced, whose corresponding loop algebra is constructed, for which an isospectral problem is established. By zero curvature equations, we obtain the nonlinear integrable couplings of the Kaup-Newell (KN) hierarchy.

Wireless network security protocols are essential for enhancing security, privacy and confidentiality. However, network security protocols also require network resources in other to carry out authentication of users through the use of encryption keys and packet encryption. It is therefore relevant to investigate the effects of the amount of resources used by recommended wireless network security protocols in other to determine if user quality of experience and user quality of service is affected by the implementation wireless network security protocols. Our research investigates and examines the effect of security protocols on wireless network performance. The Wi-Fi Protected Access 2 - Pre-Shared Key (WPA2-PSK) was used as the security protocol in focus while throughput was the network performance feature that was analyzed. Experiments were carried out which showed that throughput in a non-secured Wireless Local Area Network (WLAN) is a bit higher than throughput in a secured WLAN. Our research contributes to the future development of WLAN protocols with low network resource consumption in other to contribute to improved network performance.

The network of application service is becoming more and more increasingly complex, with the development of network communication technology, which puts forward higher requirements on network behavior characteristics, the network management and traffic control, therefore, network traffic analysis and prediction is more and more important significance. This paper presents a novel network traffic prediction model, which is based on maximum entropy algorithm. The simulation results show that the algorithm proposed in this paper has higher prediction accuracy than the traditional methods, and improves the prediction accuracy of network traffic.

In wireless communication peak to average power and channel estimation are important parameters which should be considered for efficient communication. At the receiver end, the signal is normally distorted due to channel interference and noise. In this paper we focus on complete analysis of PAPR and channel estimation in wireless communication. For this purpose we use discrete Fourier transform which has many application. In this paper we analyze the effect of increase in number of subcarrier on the performance of PAPR using discrete Fourier transform technique. The paper also describes how discrete Fourier transform can be used to remove the distortion from received signal. Our main motive is to improve the peak to average power ratio with the help of discrete Fourier transform approach. This will improve the power efficiency. All the mathematical equations and simulation for our analysis are done with the help of MATLAB software.

Since the existing underwater GPS positioning technology can only position underwater targets equipped with acoustic transponders, this study proposed a method of positioning underwater combining targets based on an ultra short baseline forward-looking sonar acoustic device. The mathematical model of the obtaining longitude and latitude coordinates of the underwater target in the WGS84 ellipsoidal coordinate system was established. A group of data was given based on the measuring state, and Monte Carlo simulation was carried out to study the effects of the random errors in the indirect measurements in the algorithm on the positioning accuracy and the combined effect of the random errors in the indirect measurements in the algorithm on the positioning accuracy at different geological locations. The preset target was measured in the offshore waters of Dalian, confirming the validity of the proposed algorithm.

The issue of data aggregation in wireless sensor networks was studied. Data aggregation was an efficient in-network data processing method. It reduced data redundancy and improved information quality, which may save communication energy and increase collection efficiency. In this dissertation, data aggregation solution (DAS) was proposed and realized. DAS used a cluster structure based network and it had three parts. Firstly, the cluster head would not submit any packets derived from the cluster members. Instead, it fused them into an outcome packet and then sent it to the sink node. Secondly, the cluster head scheduled the nodes with low energy level into sleep. Thirdly, the cluster head would use a combined forecasting algorithm to estimate the data of sleeping nodes. Simulation tests were carried out, and simulation results showed that DAS had good performance. It not only extended the network lifetime greatly, but also provided better assurance of data quality.

We present a new routing protocol in this paper to enhance junction-based routing for vehicle-to-vehicle (V2V) vehicular ad-hoc networks (VANETs). Employing effective routing table learning and maintenance, the new protocol is able to accomplish better transmission stability and lower transmission cost. In practice, the mechanism of routing table learning will help a vehicle establish its own static path information by which to locate suitable relay vehicles in a more efficient way, and the practice of routing table maintenance may substantially reduce the probability of finding no suitable relay vehicles, to avoid unnecessary packet discarding. Extended simulation is conducted to evaluate the performance of our new protocol and related routing protocols. The results exhibit that our protocol performs constantly better than others in terms of packet delivery ratios, packet drop ratios and average delay time. It ensures more efficient transmission without additional control overhead in highly mobile V2V VANETs.

The registry of Web Services is a cornerstone for service-oriented architecture and constitutes a critical resource for web services. However, whether the traditional UDDI or its extension based on semantic, has not resolve the issue. The centralized Semantic Web Service Query Tree (SWSQT) is an efficiency service registry which can be dynamically built by service publishing process. The relationships of registered web services will be stored in SWSQT data model so that the large number of ontology reasoning can be avoid at service query state. But the performance of SWSQT will be decreased under the number of services rapidly growth for its centralized architecture. In this paper it proposes a hybrid web service registry based on SWSQT. It can resolve several deficiencies of SWSQT and the experiment has further showed its feasibility and efficiency.

MANET is multi-hop network in which collection of mobile nodes is self configurable and co-operates together for communicating data without the need of any centralized component for management. Due to this dynamic nature of topology and infrastructure less frame in MANET, these nodes have to rely on each other for data transmission in multi-hop fashion and thus are prone to packet drop attacks like Blackhole attack, Co-Operative Blackhole attack, etc and various types of data security attacks. In this paper, Solutions are proposed to detect Collaborative co-operative Blackhole attack in MANET. We introduced the mechanism of TRACEROUTE that helps in detecting the source of collaborative Blackhole attack and thus break the collaboration by eliminating and marking source of Collaboration between those malicious nodes. AODV routing protocol is enhanced by introducing new field that helps in finding the optimal, secure and reliable routes. These Solutions are compared with W-AODV for Packet Delivery Ratio, Control load, accuracy in Blackhole detection and accuracy in Blackhole detection.

A route in the Internet may take a longer AS path than the shortest AS path due to routing policies. In this paper, we systematically analyze AS paths and quantify the extent to which routing policies inflate AS paths. The results show that AS path inflation in the Internet is more prevalent than expected. We first present the extent of AS path inflation observed from the RouteView and RIPE routing tables. We then employ three common routing policies to show the extent of AS path inflation. We find that No-Valley routing policy causes the least AS path inflation among the three routing policies. Prefer-Customer-and-Peer-over-Provider policy causes the most AS path inflation. In addition, we find that single-homed stub ASes experience more path inflations than transit ASes and multi-homed ASes. The AS pairs with shortest AS path of 3 AS hops experience more path inflations than other AS pairs. Finally, we investigate the AS path inflation on the end-to-end path from end users to two popular content providers, Google and Comcast. Although the majority of the shortest AS paths from end users to the two providers consists of no more than three AS hops, the actual end-to-end paths that the traffic will take are longer than the shortest AS paths in many cases. Quantifying AS path inflation in the Internet has important implications on the extent of routing policies, traffic engineering performed on the Internet, and BGP convergence speed.

Cell selection/reselection and handover (HO) are important mobility features and challenges of wireless cellular system. When network topology transforms from macro-only to heterogeneous network (HetNet) deployment, the imbalance of transmitted power and coverage area of different kinds of cells in HetNet introduce more challenges to those two important processes. In this paper, we investigate and elaborate some new algorithms and strategies to meet those challenges. On cell selection/reselection, there are two directions in associating more UEs with small cells, one is RSRP-based by introducing a empirical bias to expand small cells’ coverage area, the other is fairness-based to maximize the system throughput and usage of resources. As to more important and difficult HO process, the proposed methods include optimizing the parameters of event A3, handling time to trigger(TTT), optimizing HO process and utilizing inter-cell interference coordination algorithm(ICIC) etc, to maximize the usage of capability of deployed small cell. The presented new algorithms and strategies promise specific performance improvement with introducing receivable time and computing complexity.

Energy and bandwidth of the sensors in wireless sensor networks are highly valuable resources so must be used efficiently. Data aggregation on base station via entity nodes is the starting point of overflow of the information, which effect utmost power utilization. To reduce such obstacle, new data aggregation technique has been proposed called ERA which has improved the act of the wireless sensor network through the use of group-based data aggregation but still a lot improvement can be made. This term paper presents a review on various energy algorithms within clustering. And it has been found that none of the technique performs effectively in all fields. The major task of this survey is to find out the drawbacks in existing techniques and ERA. So this paper makes conclusion along with the future scope to overcome these problems.

In heterogeneous wireless networks (HWNs), a scheme called Joint Call Admission Control (JCAC) is demanding for deciding whether or not an incoming service request will be accepted. In this paper, we propose an optimal JCAC policy for HWNs based on semi-Markov decision process (SMDP) to achieve the optimal resource management scheme in terms of minimal the network cost and acquire the required quality of service (QoS) of mobile user. Furthermore, an improved value iteration algorithm with multi-dimensional threshold structure is presented. Numerical results show that the proposed JCAC policy is the overall optimal policy. The proposed algorithm is effective for high QoS performance by reducing the probabilities of dropping and blocking calls. The optimal JCAC policy is ratified by the current trend in the design of next generation wireless networks (NGWNs).

In the Wireless Sensor Network, a new MAC protocol: one-persistent CSMA protocol with monitoring functions and multichannel mechanism for Wireless Sensor Network based on conflict resolution algorithm is proposed. Protocol from the system throughput, collision rate, better service quality for higher priority and other aspects improve the traditional CSMA system to perfect the controllability of the system, making the system more stable for the big data, better adapted to different business. The average cycle method is used to derive rigorous mathematical expressions of specific relevant parameters. Using MATLAB simulation tool for the accuracy of the agreement is demonstrated.

The outage probability (OP) and average symbol error probability (ASEP) performance of multiple-mobile-relay-based mobile-to-mobile (M2M) networks with decode-and-forward (DF) relaying over N-Nakagami fading channels is investigated in this paper. The power allocation problem is formulated to determine how the overall transmit power should be shared between broadcasting and relaying phases for performance optimization. Then the OP and ASEP performance under different conditions is evaluated through numerical simulations to verify the analysis. The simulation results show that the fading coefficient, the number of cascaded components, the relative geometrical gain, the power-allocation parameter, and the number of mobile relays have an important influence on the OP and ASEP performance.

Wireless Sensor Networks (WSNs) are a network of large number of wireless sensor nodes deployed over a wide geographical area. The sensor nodes have a limited amount of memory as well as power. Excess extent of energy is dissipated during data transmission to the base station (sink) from normal sensor nodes. The efficient way of prolonging the lifetime of sensor nodes is clustering which optimizes the energy dissipation of WSNs. In this paper, a homogenous clustering algorithm based on fuzzy logic has been proposed in which cluster head election is done with the help of two fuzzy descriptors namely residual energy and proximity distance. The sensor nodes have been hexagonally deployed in the homogenous environment. This covers the sensing area efficiently along with reducing the redundancy in data being transmitted by the sensor nodes. This algorithm has been compared with the low energy adaptive clustering hierarchy (LEACH) protocol. The simulation results show that the proposed approach outperforms the LEACH protocol in terms of number of data packets transmitted to base station, energy consumption and prolonged network lifetime.

Wireless sensor networks (WSNs) are a new kind of data acquisition technology for danger area warning to ensure the safety of personnel production operation. In order to apply the suitable wireless node localization algorithm for danger area warning,an improved CT-IPIT+ algorithm is proposed in this paper.Considered the "edge effect", the algorithm improved the interior point judgment rules which reduces the error rate of Out-To-In effectively.Through the selection of reasonable restriction threshold, the In-To-Out error is eliminated.By counting number of inside and outside judgement results, the purpose of reducing the total error rate of misjudgment is further realized.Simulation results show that the proposed algorithm can reduce the rate of two types of errors and the total error rate can be controlled under 6.3%.

In this work, an oblivious transfer with complex access control scheme that is constructed based on ciphertext policy attribute based encryption (CP-ABE) scheme is proposed. In this scheme, the database server can enforce fine grained access control for each record where the authorized user is allowed to access, but the unauthorized user cannot, whereas it learns neither which record a user accesses, nor which attributes a user has. This scheme has the advantages as follows: First, it allows the expressive access control policies where access structures are based on linear secret sharing scheme that directly supports AND, OR and Threshold gates. Second, the communication complexity in this scheme is constant in the numbers of records which have been accessed. Third, this scheme is constructed in prime order bilinear group. Fourth, this scheme is secure in the standard model. To the best of our knowledge, this scheme is the first to obtain these features simultaneously.

5G word pertain to 5th generation communication is also known as tactile internet. A lot of improvements had been seen in telecommunication that is from 1G to 2G; 2G improves to 2.5G and 3G came in to the picture. More improved technology was introduced with advancement in 4G that is 4th Generation. As the 4G technology features improved as an advance version of 3G in terms of speed, data bandwidth & improvement of used technology. As research work in mobile communication is focusing on 5G technology and researches are progressing towards the World Wide Wireless Web (WWWW), Dynamic Adhoc Wireless Networks (DAWN) & totally real wireless world. We are expecting that 5G will be introduced in communication by 2020 which is basically user oriented. In that user can avail specific feature of 5G such as very high speed & massive data bandwidth at the low cost per bit. This paper contains how the technologies are improving from first generation to current and what are the approaches/ methodologies are followed and how can we further improve and can improved future communication technology that will be termed as fifth generation.

How to control the traffic congestion and improve the transmission capacity of weighted network is of great importance in real world networks. In some weighted networks, the weight is the geographic distance between nodes. The transmission capacity of weighted network is investigated according to different node delivery capability schemes. In the schemes that delivery capability of each node is proportional to its degree and proportional to its strength, the transmission capacity can be enhanced greatly after deleting some edges while the network integrity is still maintained. Simulations show that deleting edges according to their original weight is proved to be more effective. It is of great practical importance in designing the network topological structure.

Measuring complex Internet topology is primary research activities in Internet-related research fields and has become a focus recently. And due to the complexity of Internet topology, further processing is required and is thoroughly studied in this paper. First, Internet topology measurement is performed by CAIDA measurement approach with more than twenty monitors. Then the problem of sampling bias is quantitatively studied. Mathematical models are introduced into both the node bias problem and link bias problem, and final option is gained. Final results are that more than 156 CAIDA monitors are necessary in order to have a full Internet topology measurement result.