CEG 702 CEG 7470 Term Paper Instructor: Dr. Bin Wang This document describes the research term paper requirements and deadlines. Some possible topics are listed. You are not required to choose your...

1 answer below »
My topic is Tcp in wireless enivronment : problems and solutions


CEG 702 CEG 7470 Term Paper Instructor: Dr. Bin Wang This document describes the research term paper requirements and deadlines. Some possible topics are listed. You are not required to choose your topic from the list. Instead, you are encouraged to formulate your own topic. Topic Selection Your term paper should comprise of either (i) a thorough survey of a new topic or (ii) design, evaluation, and/or implementation of an algorithm/protocol in relevant areas. You can find relevant reference materials that appear in archive journals and conferences. Some potential topics are listed in this document. Proposal Submit a short proposal (one to two typed pages maximum) by Jan 21. You should submit the following: 1. Tentative title, author name, and email address. 2. Term paper outline: 3. Survey paper: problem statement/overview, background materials, description of existing algorithms/schemes, the way you would like to survey on/compare among them (e.g., with respect to some performance measure or implementation overhead), and possible enhancement of existing algorithms/schemes. 4. Research-oriented project: problem statement/formulation and motivation, background materials, objectives to achieve, possible methods of attack, and any pertinent information you would like me to know. 5. Time schedule listing dates of major “milestone”. 6. References (list only those actually consulted in preparing the proposal). Midterm Report Submit a short report (2 pages) by March 7 describing your progress. It should include (1) what has been achieved so far; (2) planned work for the rest of the quarter; (3) problems encountered and your plan of attack to keep your project on track. Final Term Paper Submission The term paper is due by April 22 in class. It should be of professional quality and be in the format of an IEEE transaction style. Figures must be clear and drawn by you. Proper citation of references must be embedded in the term paper. All term report should be printed in 8.5x11in format, 10 size, time new roman font, two-column, about 8 pages, left, right, top, bottom margin 1 inch, and contain the following: 1. Title page. 2. Abstract (summary of the paper). 3. Introduction (problem motivation, background materials, related work, summary of objectives and methods). 4. (i) Description of existing algorithms/protocols for survey papers; (ii) system model, assumptions, and/or formal problem formulation for research-oriented papers. 5. (i) Comparison among existing algorithms/protocols and discussion on possible improvements/enhancements; (ii) project results (derivation, proof, justification, or detailed design/simulation) in one or more numbered sections for research-oriented papers. 6. Conclusions (evaluation of results, suggestions for improvements, or future work). 7. References must follow IEEE Transactions format (at least 10 references). Proper citation of references must be embedded in the term paper. 8. Appendices (if appropriate). In particular, references used must be clearly cited in your written report at proper locations. Finally, you will have to present your term paper (about 10-15 minutes presentation) at the end of the semester. Potential Topics 1. Body area networks 2. Bio-sensors: Needs and objectives 3. Applications of wireless sensor networks in Controlled Environments 4. Object Tracking using sensor networks 5. Unconventional use of sensor networks 6. Cross Layer Activity Management in sensor network 7. Extensible Authentication Protocol (EAP) and IEEE 802. 1x 8. Accuracy and efficiency of location determination in wireless sensor networks 9. Efficient key management in sensor networks 10. Need for heterogeneity in wireless sensor networks 11. Query Execution in sensor networks 12. Usefulness of multiple radios in Sensor Networks 13. Energy efficient MAC protocols for wireless mobile networks and sensor networks 14. Forming aggregation scheme in a sensor network connected as mesh, hex and triangular schemes 15. Approximating traffic in a Mesh Network 16. Impact of partitioning of a Mesh Network on the network performance 17. Modeling of a Mobile mesh network 18. Impact of agile and cognitive radios on wireless communication 19. Multiple packet receiving schemes in ad hoc networks 20. TCP in Wireless Environments: Problems and solutions 21. Unsaturated Capacity of Ad hoc Networks 22. Optimization of Wireless Network Security 23. Study the tradeoff between the amount of network state information maintained in a network and the performance of the network in terms of, for example, the ability of establishing connections (with or without protection consideration); 24. Peer-to-peer networks; distributed file storage system; look up and routing; modeling of peer-to-peer systems 25. Wireless ad-hoc networks 26. Delay tolerant networking 27. Wireless sensor networks; power control and management; 28. Network security: anonymity, traceback, DDos (distributed denial of service attack) 29. Quality of service provisioning, scalable QoS control, overlay networks and QoS provisioning 30. Multicast, application layer multicast multicast 31. Multicast congestion control algorithms, performance modeling 32. Schemes for providing differentiated services in wireless networks, e.g., IEEE 802.11 wireless LAN, wireless Ad Hoc networks 33. Active queue/buffer management schemes, e.g., schemes that improve on RED, BLUE, RIO etc. 34. Multi-path routing algorithms in Internet 35. Multi-path routing algorithms in Ad Hoc wireless networks 36. Routing (unicast and multicast) algorithms in Ad Hoc wireless networks 37. Architectures and approaches for providing scalable differentiated services for Internet 38. Distributed fair bandwidth access algorithms for Ad Hoc wireless mobile hosts 39. Scheduling algorithms for fair bandwidth sharing in wireless networks 40. Routing algorithms/protocols for anycast 41. IP mobility support 42. Overlay networks 43. Study the impact of different placement policies of multicast grooming capable optical crossconnects (and/or optical light splitters) to the network performance in terms of, for example, throughput, connection blocking probability; 44. Traffic grooming techniques in WDM optical networks including ring network and mesh networks 45. Wavelength routing and assignment techniques for SONET optical networks, and general WDM optical networks 46. Study the feasibility and performance of p-cycle (or pre-configured cycle) approach to combat dual-failure in WDM optical networks 47. Survey the different approaches of modeling the connection establishment blocking probability in optical networks, both for unicast and multicast 48. Investigate the approach to modeling the connection establishment considering protection (i.e., a request of setting up a primary path as well as a protection path) blocking probability in optical networks 49. Metropolitan and Regional Wireless Networks: 802.16, 802.20 and 802.22 50. Wireless Personal Area Networks 51. RFID 52. Recent Advances in the Wireless Physical Layer 53. Location Management in Wireless Data Networks 54. Location Management in Wireless Cellular Networks 55. Time Synchronization in Wireless Networks 56. Power Management in Wireless Networks 57. Energy Efficient Routing in Wireless Networks 58. Mobile IP 59. Network Mobility 60. Network Architectures for Mobility 61. IEEE802.21 Media Independent Handover Services 62. QoS over WiMAX 63. QoS in Wireless Data Networks 64. QoS in Cellular Networks 65. TCP Optimizations for Wireless 66. VoIP/Multimedia over WiMAX 67. Voice over Wireless 68. Security in Wireless Data Networks 69. Security In Wireless Cellular Networks 70. Aircraft Wireless Networks 71. Inter/Intra-Vehicle Wireless Communication 72. Medical Applications of Wireless Networks 73. Web information systems 74. Security, trust, and privacy 75. Software defined networking 76. Edge/fog computing 77. Internet of things security 78. Smart city/home
Answered 8 days AfterApr 04, 2022

Answer To: CEG 702 CEG 7470 Term Paper Instructor: Dr. Bin Wang This document describes the research term paper...

Dr Raghunandan G answered on Apr 13 2022
110 Votes
TCP in Wireless Environment: Problems and Solutions
Abstract-The emergence of high-speed multimedia services in wireless applications, advancements in the field of wireless internet-based IP communications, and modern enhancements or modifications to this protocol suite for greater performance are all factors to consider. Throughout the decades, wireless technology has been extensively employed to investigate its potential in delivering long-term solutions to a variety of challenges. There has been a lot of research done in the Wireless Network environment, and it has has a broad range of applications, demonstrating that this technology is quite efficient. The additive increase multiplicative decreases control of congestion of standard TCP protocol approaches the ste
ady state, that shows efficiency of the protocol in terms of link utilisation and throughput, depending upon the notion that losses of packets are indications of congestion of network. When the end-to-end path also comprises wireless communications, however, this premise falls apart. End-to-end delay, overhead, ARQ, ACK, congestion, and QoS are all taken into account while analysing the various methods. Because of its impotency to identify losses of packets induced by congestion of network, the unmodified standard TCP performs badly in a wireless setting, according to numerous studies. With a brief introduction of TCP, we explore the issues TCP encounters in the wireless IP communication context as well as provide specific examples of feasible solutions.
Key Words: TCP, Wireless Networks,Congestion,QoS,Internet Protocol
I. Introduction:
A collection of hundreds or more nodes constitutes a Wireless Network. These networks can be operated in different applications which require unattended operations which can directly communicate with the external base station that provides a range of sensing over a large geographical location with high accuracy or it may also communicate among themselves. These have a broad range of applications namely personal communication, military, environment monitoring, battlefields. In recent years, a number of energy-efficient sensor-network techniques or protocols have been introduced. Wireless communications have become more widely employed on the WLAN level as weH in recent years for radio mobile networks as a means of emigrating to an IP world. However, using TCP protocols in wireless networks comes with a number of issues, one of which is assuring a legitimate end-to-end data transfer. TCP, at the same time, thinks primary cause of loss of packet on the internet is congestion, and as a result, it provides techniques to deal with congestion. Packet loss in mobile networks is mostly caused by physical link characteristics and connection failure. If TCP is utilised in such networks, these losses will be interpreted as congestion issues. This isn't the case at all. TCP can be adapted to wireless contexts in a variety of ways. There are many approaches to adapt TCP to wireless environments.
One of the c1 classification of the solutions is as follows
• Proposed solutions for extending standard TCP to the wireless communication environment. This can be accomplished by adding new algorithms and motions to existing systems, or by revamping them entirely.
• TCP IP protocol stack modification solutions
Separating the rest of the link from the wireless link is the first method.
This is referred to as hybrid architecture. Snooping-TCP Indirect-TCP, and WTCP among these approaches are discussed.
•Link layer solutions or application layer solutions are only found in a few other existing systems.
Fig 1 Shows the data and ACK transmission process. It illustrates the entire flow of data and acknowledgement between source and receiver side.
Fig 1: Data and ACK Transmission Process
When the load of the network is less, the throughput rises rapidly, but the delay will rise slowly; when the load increases after the Knee point, the throughput will increase slowly, but the delay will increase rapidly; and when the load exceeds the Cliff point, a rapid decrease in the throughput is observed, while the delay increases rapidly. When a network is overburdened, packets take longer to arrive and have a higher chance of being dropped. The router will spend its link bandwidth to transmit redundant packet copies due to the sender's unneeded retransmission with a long time delay. The sender will retransmit the packet that was dropped due to cache overflow when the risk of packet drop increases. As a result, link transmission capacity will be wasted, and the effective utilisation rate would be reduced. The following are the direct causes of congestion: • Inadequate storage space; insufficiency of capacity of bandwidth; and poor processor management all contribute to congestion. The three causes listed above must be considered in so as to avoid traffic congestion.
Current Internet congestion control system is on TCP window control, with IP layer routers playing a minor role. In this paper, we discuss some of the issues and some of the solutions that have been presented. The major issue is then addressed by providing our solution, which we refer to as FACK-TCP (for Forced Acknowledgement TCP), as well as its design and behaviour. The establishment of a protocol that is transparent to both endpoints and simply deployable is the breakthrough that we have made in this proposal. Finally, we show some of the outcomes of our simulations and compare them to those of TCP-Reno and Snooping-TCP. In this paper, Section II deals with Existing algorithms, section III discusses the comparison of the existing algorithms based on different parameters and section IV finally concluding the paper.
II. Existing Algorithms
The operation of different algorithms related to TCP are discussed in this section. The overview of some of the promising algorithms are discussed and their drawbacks are pinpointed to give the scope for future research work.
A. Adaptation of Protocol Radio Mobile Network

According to Split-connection Strategy, the relationship between the mobile host (MH) and the fixed host (FH) is divided with the help of a Mobile Support Router (MSR). This approach was used by one of the original protocols [1]. The MSR is a router that is housed in the base station. The fundamental benefit of this protocol is that it allows packets to be forwarded from the fixed host (FH) to mobile host (MH). This protocol isolates a wireless network's flow and congestion constraints from a fixed network. Furthermore, mistakes in transmission and packet losses on the wireless link will prevent transfer to the fixed network. However, there are several drawbacks to this strategy. End-to-end TCP semantics are lost Acknowledgements don't have a end to end meaning. Before the packets arrive at the destination of the mobile host, acknowledgement packets may arrive at the fixed sender host.Overhead is another drawback of this approach: here, each packet introduces overhead. This is due to the fact that At the MSR, TCP packets are created twice. Data starting from incoming TCP to outgoing TCP must be copied at the MSR. It saves the fixed host in two ways with this method. [2]. The first approach is ARQ (Automatic Repeat request), in which data is divided to packets and then error checking sequences (usually through CRC computing) are attached, allowing the receiver to check for packets that are corrupted and request retransmission. The second approach is FEC (Forward Error Correction) is a technique for error detection and correction at the receiver in which unwanted blocks are combined with information packets before they are transmitted. End-to-end TCP enhancements: This strategy aims to increase the...
SOLUTION.PDF

Answer To This Question Is Available To Download

Related Questions & Answers

More Questions »

Submit New Assignment

Copy and Paste Your Assignment Here