Network

Wireless Sensor Networks consists of spatially distributed autonomous sensors called nodes which co-operatively monitor a physical or environmental condition. Due to the scarce energy reserves in the sensor networks it is necessary to design protocols which minimize the energy consumption. In this paper, we firstly analyze the LEACH protocol in a homogeneous environment and then present a novel clustering based routing protocol for sensor networks. The simulation results show that the proposed protocol prolongs the network lifetime with 70% of the nodes remaining alive when compared to LEACH.

Cloud computing is clearly one of today’s most enticing technology areas due, at least in part, to its cost-efficiency and flexibility. However, despite the surge in activity and interest, there are significant, persistent concerns about cloud computing that are impeding momentum and will eventually compromise the vision of cloud computing as a new IT procurement model. In this paper, we characterize the problems and their impact on adoption. In addition, and equally importantly, we describe how the combination of existing research thrusts has the potential to alleviate many of the concerns impeding adoption. In particular, we argue that with continued research advances in trusted computing and computation-supporting encryption, life in the cloud can be advantageous from a business intelligence standpoint over the isolated alternative that is more common today

Routing protocols govern the prime path for data communication amongst network nodes. These protocols are employed once there is a major growth in organisations were, static routes are uncontrollable. Distance vector routing protocols which is one of the two main routing protocols for communication uses data packets sent over Internet Protocol (IP). This routing protocols are classified into Enhanced Interior Gateway Routing Protocol (EIGRP) and Routing Information Protocol (RIP). They are dynamic Internet Gateway Protocols (IGPs) which route packets within one Autonomous System (AS). However, RIP is considered an effective solution for small homogeneous networks. An organisation who needs to expand its network cannot use the RIP due to its limitations of fifteen hop counts. This problem has been a major concern in corporate organisations which hence the need for an improved distance vector routing protocol. EIGRP although, is a Cisco proprietary protocol based on Diffused Update Algorithm (DUAL) was introduced in this research to serve as an extension to an organisation’s network. Packet flowing from RIP network interface if exhausted its maximum hop count, can re-route its packet through EIGRP network interface. With this improvement, organisations have no worries of changing the entire routing protocol.

There are many primitive trust systems which have adopted unique approach for communication in Wireless Sensor Networks. These traditional trust systems do not meet the requirements like maintaining resource efficiency and dependability between nodes in Clustered Wireless Sensor Networks. This is because of their high overhead and low dependability. LDTS (Light-weight and dependable trust system) proposes low communication overhead and makes efficient use of energy resources by proposing light-weight algorithm. Also LDTS (Light-weight and Dependable Trust System) proposes dependable trust system that helps improving system efficiency by reducing effect of malicious nodes. As compared to traditional trust systems LDTS (Light-Weight and Dependable Trust System) demands less memory .So it can be said that LDTS is light weight and dependable trust system for communication in clustered wireless sensor networks.

In this paper an algorithm for alternate path is implemented. The evaluation matrices for the shortest available path are velocity of the leading vehicles, distance from source to destination and time delay to reach to destination. Simulation shows, if there is congestion on the current path then the node will find for an alternate shortest path in digital map to the destination. This will avoid the congestion on a single road at intersection points. But the system has to make search every time the vehicle found congestion on the way for destination. The graph given below shows, the traffic moving according to the pause time on the roads due to any reason like traffic light, accident or any other obstacle. X axis is labeled as time delay and Y axis contained no. of nodes/packets moving towards an intersection point to destination. Whenever the no of nodes becomes more, the pause time will be increased. Upper and lower points in the graph show congestion. At these points, where the graph goes upwards, the congestion is increased at a single intersection point. But where the graph goes downwards, the congestion is reduced to a lower value; because some nodes used alternate route/path to reach to the destination.

Research and Realization of a Web Information Extraction based on Xpath expansion. This algorithm marks importance weight of semantic blocks and obtains a model of block importance. This information extraction method based on Xpath expansion forms extraction rule corresponding to web site. Lastly, this algorithm extracts the text information blocks of theme-based web pages. It uses a case to confirm that this algorithm can accurately complete the extraction task of text information blocks in the theme-based web pages.

In the Long Term Evolution (LTE) network, buffer overflows often occur in the evolved Node B (eNB) when dealing with the traffic bursts from the wired part due to restricted bandwidth or environmental interferences in the wireless part. In this paper, a survey on approaches is proposed to protect the buffer from overflow by appropriately controlling the advertisement window to enhance the Transmission Control Protocol (TCP) when the buffer becomes congested. The sender will slow down the data sending rate upon the receipt of reduced advertisement window, and hence the buffer overflow will be alleviated. To evaluate the suggested solution, a LTE network model is implemented and validated through extensive numerical experiments. It is demonstrated that the proposed approach can enhance the end to end system performance in terms of network throughput, average packet delay and jitter, as well as packet loss rate.

Prolonging lifetime of WSN is a critical issues today. For overcoming this issue a good WSN design needed to be energy efficient. Routing is one of the reasons for reducing the lifetime of WSN. By using energy aware routing algorithm we can maximize the life of the network. In this paper we have used load balancing ACO algorithm with TARF to overcome energy problem in WSN. This algorithm help in providing shortest path reduce energy and time consumption and provide security against attacks.

Mobile Ad-hoc Networks (MANET) is the self organizing collection of mobile nodes. The Optimized Link State Routing (OLSR) protocol was designed to improve scalability of Mobile Ad-Hoc Networks (MANETs). OLSR protocol implements Multipoint Relay (MPR) nodes as a flooding mechanism for distributing control information. Nevertheless, OLSR was designed without security measures. There-fore, a misbehaving node can affect the topology map acquisition process by interrupting the flooding of control information or disturbing the MPR selection process.

Orthogonal frequency division multiplexing (OFDM) has been one of the key contenders in various broadcasting standards, due to its immunity towards multipath fading and ease of implementation. But the issue security has not been addressed much, which calls for a separate modules performing encryption. Here a scheme of Encryption jointly with OFDM has been proposed based on rearranging the OFDM subcarriers to make the data non intelligible, which provides transit data security. Simulation results show that the proposed scheme provides both security and immunity against fading, together. Also, compared to the conventional OFDM system, this scheme provides encryption with no BER performance degradation and no additional bandwidth.