I need a research paper for one of the topics listed below Internet applications

Question

I need a research paper for one of the topics listed below Internet applications or wireless lans or data communications or multimedia ...it should define a problem and then research related information.. The paper should have a problem ...goal...significant and related work...and current research going on the topic choosed...conclusion and future work...this can be taken from the text book data and computer communications 10th edition william stailings....yu can review even computer networking a top down approach fifth edition. I need a research paper for one of the topics listed below Internet applications or wireless lans or data communications or multimedia ...it should define a problem and then research related information.. The paper should have a problem ...goal...significant and related work...and current research going on the topic choosed...conclusion and future work...this can be taken from the text book data and computer communications 10th edition william stailings....yu can review even computer networking a top down approach fifth edition.

Explanation / Answer

Abstract

Much of the current research in wireless mesh networks has focused on protocols, algorithms and authentication schemes for protecting the data during data transmission. The wireless mesh network communication has become an explicating and important technology in recent years because of the rapid proliferation of wireless devices. WMN are highly vulnerable to attacks due to the open medium, dynamically changing network topology.

This paper proposes and evaluates strategies to build reliable and secure communication in multi –radio multi-channel mesh networks using M2-MAC protocol. So we analyze mitigating misrouting in wireless multi radio multi channel milieu using M2-MAC protocol and extensively show that our scheme provides very good enhancements in a variety of scenarios.

Related Work

                In the last few years, researchers have been actively exploring many mechanisms to ensure the security of control and data traffic in wireless networks. These mechanisms can be broadly categorized into following classes- cryptographic building blocks used as support for key management, authentication and integrity services, protocols that relay on path diversity, protocols that overhear neighbor communication, protocols that use specialized hardware and protocols that require explicit acknowledgement are also used as building blocks for protocols of the other classes.[14].

The four modes of the stealthy packet dropping attack. [15]. we distinguish between an external malicious node, which does not possess the cryptographic keys in the network, and internal compromised nodes, which do and are created by compromising an erstwhile legitimate node. Consider a scenario in which a node called S is forwarding a packet to a compromised node called M. M is supposed to relay the packet to the next-hop node D. The first form of the attack is called packet misrouting. In this mode, M relays the packet to the wrong next –hop neighbor.

Baseline local monitoring [BLM] is a collaborative Strategy where a node monitors the control traffic going in and out of its neighbors.

The rest of the paper is organized as follows section 3 talks about the description of stealthy dropping attack. Section 4 describes the M2-MAC protocol for wireless mesh networks.             Section 5 explains the Mitigation Misrouting Packet Drop over (M2-MAC) protocol. Section 6 concludes the paper.

Mitigation Misrouting Packet Drop over (M2-MAC) protocol

In this section, we propose M2-MAC protocol to enable the detection of stealthy packet dropping attacks, data transmission and particularly mitigating the misrouting.

Dynamic channel allocation for data transmission and mitigating misrouting

In M2-MAC, first the REQ/ACK/RES mechanism is used to allocate the channels for data transmission. All control messages are exchanged over the ACCA’s resulting channels for mitigating misrouting. The second coordination stage describe by following steps:

Step 1: Once a beacon comes, if a source node (node S) has data pending for a destination (node D), S should check its CRUSS to find whether a radio and an available channel can be used for data transmission. If so, S waits for TDIFS and a random exponential back off value, and then transmits a packet REQ (Channel Radio Utilization Structure(S)) to M and broadcasts it to S’s neighbors. If node S does not have data pending, then S must wait until the next beacon comes.

While the REQ process packet header incorporate with additional functionality and information. To collect the next-hop identity information, the forwarder of the REQ packet header attaches the previous hop’s information (Sbroadcast à||Si ||Did|| REQid||Aid||Mid|| Verification table|| Timestamp)   and timestamp for calculate the possible maximum distance between S and D , when sending time of data packets.

Step 2: Once node D receives the packet REQ (CRUSS), D has to check whether it has idle radios. If it does not, then D sends an acknowledgment message ACK (InValid) to S and broadcast it to D’s neighbors to inform them that all radios on D are busy. If it does have idle radio, then D needs to select list of shortest channels in terms of priority for data transmission.

Step 3: when D receives the REQ packet, it verifies authenticity of source. Then D generates a route reply packet REP that contains (Dbroadcastà||Did||Sid||REPid||Aid||Mid||Verification table||Timestamp). The REP continues to propagate using the reverse path of the corresponding REQ towards S. S will check the information carried by ACK. If it is Null or InValid or CHk, S cancels the negotiation process and goes to step 1, if it is CHk. Then S will check if this channel can still be used. If that is the case, S updates it’s CRUSS and then broadcasts a reservation message RES (CHk) across the network.

Then verifies the authenticity and calculates maximum possible time interval between S and D from the difference between sending time of data and receiving time of data and assuming that the control packet travels with the speed of light. .

  

                One must note that all the control messages, REQ, ACK, and RES, are transmitted over the allocated control channels from the first coordination stage. At this stage, ACCA is able to indicate the mapping relationship for which radio should be tuned to which control channel. Obviously, the hidden node problem can be alleviated in M2-MAC.

Conclusion

                We focused on analyzing the ability of routing protocols to provide correct service in the presence of stealthy attack. This goal is achieved by M2-MAC coordination secure protocol resilient to misrouting failures caused by an adversary or group of malicious node. At the first coordination stage an intelligent control channel allocation algorithm make all the available channels are designated as control channels and data channels on Channel Negotiation and Allocation (CNA) and Data Transmission (DT) sub-intervals. At the second stage, a REQ/ACK/RES mechanism is proposed to realize dynamical channel allocation for mitigate misrouting and provide the data transmission mechanism in wireless mesh networks.

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.