Key Topics
WIRELESS COMMUNICATIONS & NETWORKS
Write a tutorial paper of between 3000 and 4000 words on a topic that either
extends what presented in the lecture course or on a topic that is within the scope of
wireless communications and networks but not covered in the lecture course (feel
free to check with me if you are unsure about your topic).
Based on the topic you have selected, in the evaluation section of the paper you
need to provide some simple simulation results and analysis using any of the Matlab
/ NS2 or 3 / OMNET++ or other related simulators, open source or proprietary. Your
selection should be unique to you by using the arithmetic part of your KU number for
setting up your simulations, e.g. fundamental frequency or distance. Furthermore, it
should include the following steps:
- provide a scenario, e.g. rural environment.
- design the network, e.g. give number of application servers, base stations, routers
and end users.
- evaluate the performance of the selected algorithm or protocol, e.g. scheduler,
mobility management protocol, resource management algorithms etc, in terms of
throughput, delay, jitter or any other evaluation metric/statistic you feel is relevant
to your design and scenario.
- build a system/network analysis based on these simulation results and finally
- provide recommendations and comments on your results.
The paper should be presented in a form suitable for professional journal publication
with two columns of 12 point text with headings of 14 bold point text and should be
consistent with the following guidelines.
Title of Paper in 16 bold point characters
Name of author
Abstract
Introduction
Section headings
Evaluations
Conclusion
References
extends what presented in the lecture course or on a topic that is within the scope of
wireless communications and networks but not covered in the lecture course (feel
free to check with me if you are unsure about your topic).
Based on the topic you have selected, in the evaluation section of the paper you
need to provide some simple simulation results and analysis using any of the Matlab
/ NS2 or 3 / OMNET++ or other related simulators, open source or proprietary. Your
selection should be unique to you by using the arithmetic part of your KU number for
setting up your simulations, e.g. fundamental frequency or distance. Furthermore, it
should include the following steps:
- provide a scenario, e.g. rural environment.
- design the network, e.g. give number of application servers, base stations, routers
and end users.
- evaluate the performance of the selected algorithm or protocol, e.g. scheduler,
mobility management protocol, resource management algorithms etc, in terms of
throughput, delay, jitter or any other evaluation metric/statistic you feel is relevant
to your design and scenario.
- build a system/network analysis based on these simulation results and finally
- provide recommendations and comments on your results.
The paper should be presented in a form suitable for professional journal publication
with two columns of 12 point text with headings of 14 bold point text and should be
consistent with the following guidelines.
Title of Paper in 16 bold point characters
Name of author
Abstract
Introduction
Section headings
Evaluations
Conclusion
References
A Study on Mobile Ad Hoc Network using Routing Algorithm Evaluation
ABSTRACT
MANET (Mobile Ad Hoc Network) is a device where it is made up of many of wireless devices like mobile, laptops, etc. It can be used for providing the communication between the wireless medium and in which the communication will take place through air. MANET can be used for its unique characteristics like hop to hop communication, dynamic topologies, easy implementation and faster access of the data. Some of the security issues in the MANET can be raised due to its self maintenance and self configuration techniques. In this paper , we are going to look into the brief concepts of MANET and their issues and its working methodologies. Particularly assigned systems association enables the gadgets to keep up association with the structure and feasibly adding and removing contraptions to and from the structure. After some time the topology structure can be changed due to the nodal accommodation. Association and message development can be executed with the middle focus devices when the structure is decentralized. Message controlling is an issue in a decentralize condition where the topology vacillate. While the briefest course from a source to a goal in light of a given cost work in a static system is typically the ideal course, this thinking is hard to stretch out in MANET. The game-plan of occupations for MANETs is incidental, going from gigantic scale, versatile, to great degree noteworthy structures, to practically nothing, static systems that are obliged by control sources [1].
I. INTRODUCTION
Mobile Ad Hoc Networks (MANETs) has ended up being a champion among the most extensively saw zones of research in the stream a long time in setting of the troubles it position to the related traditions. MANET is the new making movement which attracts customers to permit with no physical establishment paying little regard to their land zone, that is the reason it is every once in a while surmised as a foundation less framework [2]. The expansion of more sensible, little and all the also persuading contraptions make MANET a snappiest influencing net-to work. A surprisingly doled out framework is self-overseeing and versatile. Device in flexible with no arrangement framework should have the capacity to see the closeness of various contraptions and perform basic set up to help correspondence and sharing of data and affiliation. Astoundingly selected structures affiliation draws in the contraptions to keep up relationship with the framework and in like way easily adding and ousting devices to and from the structure. Due to nodal adaptability, the structure topology may change rapidly and inquisitively after some time. The structure is decentralized, where deal with association and message advancement must be executed by the gadgets itself. Message arranging is an issue in a decentralize condition where the topology change. While the most brief route from a source to an objective in light of a given cost work in a static structure is normally the perfect course, this reasoning is difficult to interface in MANET. The approach of uses for MANETs is unexpected, stretching out from clearing scale, adaptable, exceedingly phenomenal structures, to nothing, static frameworks that are constrained by control sources.
II. MANET SCENARIO
Modeling is the course toward creating a model to convey the honest to goodness structure with some streamlining assumptions. This system is to empower the fashioners or the customers to examination, test and change the structure parameters to show their things and relations to each other. Such process ought to be conceivable without any results for the honest to goodness structure as a fit sensible way. Such process should be possible with no outcomes for the true blue framework as a capable sensible way. It can spare expenses in structure progress if the indicating technique is truly overseen. In the framework outline and progress plans, the demonstrating is fundamental to give a thought of how the structure would perform in the event that it genuinely finished. Stimulation is "intimating or surveying how occasions may happen in a certifiable circumstance". This procedure offers a superior than normal lab to recreate and exhibit the lead of the structure focus focuses and the correspondence channels. Reenactment approach is constantly related and used to certify sensible models, list the deferred outcomes of the estimations and to test and assess the proposed new customs execution separated and the present conventions [3]. One of the essential objectives of structure redirection is to consider make execution. In light of the flexible quality, inconvenience of looking at genuine structures and costs the reenactment framework has changed into the most transcendent strategy in PC and media transmission deal with gets some information about and movements. It can be utilized to check decisive models, total up the estimation happens, review the execution of new conventions that are being made, and besides to think about the present customs.
III. MANET DESIGN
The MATNET design for this environment can be designed with different devices like servers, laptops, mobile devices, routers, etc. The system consists of many devices to make the communication between them and the connections will be done with the help of the access points provided at the center of the system. In the ad hoc networks the access points can be considered as the fixed device and other devices in the network will make the connection with all the other devices with the help of the access points provided. When the access points are used in the system then that network can be termed as the infrastructure network [2]. Refer the fig 1 for MANET Design of the network. MANET is an aggregation of no less than two contraptions or centers or terminals with remote correspondences and frameworks organization limit that talk with each other without the guide of any united head moreover the remote center points that can continuously shape a framework to exchange information without using any current settled framework structure.
Fig 1: MANET Design
The remarkable features of Mobile Ad Hoc Network (MANET) bring this advancement unbelievable open entryway together with extraordinary troubles .All the center points or devises able to deal with themselves intensely the correspondence between the each other and to give the fundamental framework helpfulness without settled system or we can call it ventral association, It suggests that upkeep, controlling and association, and so on must be done between every last one of the inside focuses. At last, reason that the Ad Hoc Nodes or gadgets are troublesome and more personality boggling than different remote systems. Accordingly, Ad Hoc Networks shape kind of bunches to the viable use of such a bizarre procedure. In the recent years, the comprehensive group bent up plainly perceived to utilize all the progression so exhaustively and the comprehensive group's future living conditions are climbing, in context of data asset gave by the relationship of various correspondence structures for customers in addition we have seen a snappy change in the field of Mobile Computing in light of the way that the expansion not costly, widely accessible remote gadgets another little contraptions, for example, solitary correspondence like PDAs, PCs, Personal Digital Assistants (PDAs),handhelds, furthermore there's a great measure of standard home mechanical congregations, for example, an impelled cameras, cooking stoves, articles of clothing washers, coolers and indoor controllers, with figuring and passing on powers joined. Build up this zone to changed into an absolutely certain thus widely [3]. With the predominant piece of this, the advances must be shaped the monster and new standard of unavoidable taking care of, that including the new measures, new contraptions, associations, gadgets, conventions and other structures.
IV. PERFORMANCE EVALUATION
4.1 Routing Algorithm
Proactive calculation for the most part called Time Driven Routing estimation, hone courses past anybody’s capacity to see self-overseeing of development requests. Each middle uses controlling data to store the district data of different focus focuses in the structure and this data is then used to move information among various focuses in the system. Objective Sequenced Distance Vector (DSDV) The strategy for DSDV Each middle point keeps up a table with a zone conceivable goal. Each segment illustrates: The goal identifier. The going with skip on the course to the goal. The division (to the degree jump) to the target. A social occasion number that shows how new the course is. Focus focuses trade their coordinating tables with their neighbors now and again. OLSR is a consider proactive ricochet by bob organizing custom. It gives the crisp technique for target base of table driven approach [7]. It is a streamlining of unadulterated affiliation state figuring in spontaneous structure. The courses are continually quickly open when required in perspective of its proactive nature. The key idea of the custom is the use of “multipoint trades” (MPR). Each inside point picks a strategy of its neighbor focus focuses as MPR. Each inside point impacts a quick overview of its one skip to neighbor. Neighbor focus point trades their rundowns with each other. In light of the got records, each middle point makes its MPR [5]. Iv. The general population from MPR is the key focuses that can retransmit the affiliation state data endeavoring to force the surge. Right when an inside direct wishes toward transmit change to a host to which it has no course, it will pass on a course request (RREQ) message that will be overpowered limitedly to various focus interests. This causes control advancement overhead to be dynamic and it will get a handle on a concealed yield when beginning such correspondence. AODV plots three sorts of control messages for course fortify: RREQ – A course request message is transmitted by an inside requiring a course to a center point. This regard is set to a predefined regard at the fundamental transmission and connected at retransmissions. Retransmissions happen if no answers are gotten. Data wraps holding up to be transmitted should be kept up locally and transmitted by a FIFO noteworthy when a course is set. RREP – A course answer message is unicasted back to the originator of a RREQ if the gatherer is either inside point using the requested address, or it has a key course to the requested address. The reason one can unicast the message back, is that each course sending a RREQ stores a course back to the originator. Iii. RERR – Nodes screen the conspiracy status of next skips in one of kind courses. Unequivocally when a connection breakage in a dynamic course is seen, a RERR message is used to reprimand unmistakable concentration centers concerning the event interface. With a particular silly fixation to pull in this checking structure, each center point keeps a "predecessor once-finished", containing the IP address for each it neighbors that are probably going to use it as a next ricochet towards each objective.
4.2 MANET Performance Evaluation
Throughput: Throughput can be measured in terms of the amount of data that is received by the receiver in the time given.
Throughput = packets received / time of simulation
Dropped Packets: Each one of the bundles that must be dropped in light of compactness or full lines or by aggressors are contained in this arrangement. The amount of dropped data packs may be as a result of the association disillusionment. Essentially, it addresses the amount of bundles that sent by the source centre point and disregard to reach to the objective centre point.
Dropped packets = no of packets sent – no of packets received
Average end-to-end delay: Time difference between the packets that is sent and received between the networks can be referred as the End-to-end packet delay [5]. Delay of packet can be measured when the packet leaves the sender machine and the packet sent to receiver device. The packet delay can be made due to the medium access protocols and propagation channels.
E2E delay [packet_id] = received time [packet_id] – sent time [packet_id]
Normalize Routing Load: Operating cost evaluation and routing efficiency can be used for the load efficiency of normalized routing. The ration of the routing sent and received can be represented for the normalized routing load representation. It can be denoted as the packets that are transmitted per data packet.
NRL = number of routing packets/ number of received packets
Packet delivery fraction: Number of packets that are sent successfully to the receiver can be represented as packet delivery fraction. It can be evaluation by making the division operation on number of packets sent and received. Their percentage will be measured as the packet fraction
PDF = (received packets total / sent packets total) * 100
Average Jitter: The average value measured from the sequential packets that are sent between the end delays termed as average jitter.
Jitter = | (end-to-end delay (n+1)) – (end-to-end delay (n))|
Proactive calculation for the most part called Time Driven Routing estimation, hone courses past anybody’s capacity to see self-overseeing of development requests. Each middle uses controlling data to store the district data of different focus focuses in the structure and this data is then used to move information among various focuses in the system. Objective Sequenced Distance Vector (DSDV) The strategy for DSDV Each middle point keeps up a table with a zone conceivable goal. Each segment illustrates: The goal identifier. The going with skip on the course to the goal. The division (to the degree jump) to the target. A social occasion number that shows how new the course is. Focus focuses trade their coordinating tables with their neighbors now and again. OLSR is a consider proactive ricochet by bob organizing custom. It gives the crisp technique for target base of table driven approach [7]. It is a streamlining of unadulterated affiliation state figuring in spontaneous structure. The courses are continually quickly open when required in perspective of its proactive nature. The key idea of the custom is the use of “multipoint trades” (MPR). Each inside point picks a strategy of its neighbor focus focuses as MPR. Each inside point impacts a quick overview of its one skip to neighbor. Neighbor focus point trades their rundowns with each other. In light of the got records, each middle point makes its MPR [5]. Iv. The general population from MPR is the key focuses that can retransmit the affiliation state data endeavoring to force the surge. Right when an inside direct wishes toward transmit change to a host to which it has no course, it will pass on a course request (RREQ) message that will be overpowered limitedly to various focus interests. This causes control advancement overhead to be dynamic and it will get a handle on a concealed yield when beginning such correspondence. AODV plots three sorts of control messages for course fortify: RREQ – A course request message is transmitted by an inside requiring a course to a center point. This regard is set to a predefined regard at the fundamental transmission and connected at retransmissions. Retransmissions happen if no answers are gotten. Data wraps holding up to be transmitted should be kept up locally and transmitted by a FIFO noteworthy when a course is set. RREP – A course answer message is unicasted back to the originator of a RREQ if the gatherer is either inside point using the requested address, or it has a key course to the requested address. The reason one can unicast the message back, is that each course sending a RREQ stores a course back to the originator. Iii. RERR – Nodes screen the conspiracy status of next skips in one of kind courses. Unequivocally when a connection breakage in a dynamic course is seen, a RERR message is used to reprimand unmistakable concentration centers concerning the event interface. With a particular silly fixation to pull in this checking structure, each center point keeps a "predecessor once-finished", containing the IP address for each it neighbors that are probably going to use it as a next ricochet towards each objective.
4.2 MANET Performance Evaluation
Throughput: Throughput can be measured in terms of the amount of data that is received by the receiver in the time given.
Throughput = packets received / time of simulation
Dropped Packets: Each one of the bundles that must be dropped in light of compactness or full lines or by aggressors are contained in this arrangement. The amount of dropped data packs may be as a result of the association disillusionment. Essentially, it addresses the amount of bundles that sent by the source centre point and disregard to reach to the objective centre point.
Dropped packets = no of packets sent – no of packets received
Average end-to-end delay: Time difference between the packets that is sent and received between the networks can be referred as the End-to-end packet delay [5]. Delay of packet can be measured when the packet leaves the sender machine and the packet sent to receiver device. The packet delay can be made due to the medium access protocols and propagation channels.
E2E delay [packet_id] = received time [packet_id] – sent time [packet_id]
Normalize Routing Load: Operating cost evaluation and routing efficiency can be used for the load efficiency of normalized routing. The ration of the routing sent and received can be represented for the normalized routing load representation. It can be denoted as the packets that are transmitted per data packet.
NRL = number of routing packets/ number of received packets
Packet delivery fraction: Number of packets that are sent successfully to the receiver can be represented as packet delivery fraction. It can be evaluation by making the division operation on number of packets sent and received. Their percentage will be measured as the packet fraction
PDF = (received packets total / sent packets total) * 100
Average Jitter: The average value measured from the sequential packets that are sent between the end delays termed as average jitter.
Jitter = | (end-to-end delay (n+1)) – (end-to-end delay (n))|
Place Order For A Top Grade Assignment Now
We have some amazing discount offers running for the students
Place Your OrderV. SIMULATION RESULT
Simulation result can be derived from the packet transmission that is done in the simulator. The main objective is to transmit the packets from the sender device to the receiver device and check for the throughput, delay and dropped packet counts in the packets. The graph representation can be presented for packet transmission at different time duration. Throughput can be measured in terms of the amount of data that is received by the receiver in the time given. Each one of the bundles that must be dropped in light of compactness or full lines or by aggressors is contained in this arrangement. Time difference between the packets that is sent and received between the networks can be referred as the End-to-end packet delay. Operating cost evaluation and routing efficiency can be used for the load efficiency of normalized routing. The ration of the routing sent and received can be represented for the normalized routing load representation. It can be denoted as the packets that are transmitted per data packet. Number of packets that are sent successfully to the receiver can be represented as packet delivery fraction [4]. It can be evaluation by making the division operation on number of packets sent and received. Their percentage will be measured as the packet fraction. The average value measured from the sequential packets that are sent between the end to end delays termed as average jitter. Packets received = 10, time of simulation = 2s, throughput = 10/2 => 5. No of packets sent = 4, no of packets received =3, Dropped packets = 4-3 => 1. Same way average delay factors, normalized routing load, jitter, packet delivery fraction will be calculated.
Fig 2: Graphical representation of simulation
Thus the figure 2 represents about the simulation that is done in the MANET scenario for the above discussed environment. The throughput has been calculated for the packet transmission that is done in the different time duration. This can be helpful for finding the number of packets that will be lost during the time of transmission. Normalized routing loads can be calculated for finding the number of packets that has been sent to the receiver. The extended execution for the trusted centre points is a result of the going with trust decisions - enduring packs just from a trusted past hop, sending packages just to a trusted next-bob, multiplying simply place stock in groups, and using just trusted in courses. The result asserts that the trust show is viably prepared to set up genuine courses, paying little heed to the growing degrees of poisonous centre points. Nevertheless, the probability of finding a trusted course reduces, and in turns the PDR, as the degree of dangerous centre points outperforms the degree of place stock in centre points.
VI. RECOMMENDATION
Despite whether no idiosyncrasies are open in the information the remarkably skew disseminating of pay reinforces a light robustification over the non-profitable set up estimators. A robustified Horvitz-Thompson (RHT) estimator with a tuning constant of k = 6 is everything seen as a not extremely horrible sure with low slant if the data contains no astounding cases and with no not as much as an unessential request against some remarkable inconsistencies. A trimmed mean (TM) with light trimming of 0.5% of clearing affirmations takes after a robustified Horvitz-Thompson estimator. The RHT has the favoured perspective that it doesn't down weight any learning whether there ought to be an event of particularly all around acted data, while the TM dependably down weights the fated level of the data. The quintile share degree should continually be researched with a vivacious estimator. The non-parametric SQSR estimator with an especially slight trimming above, say correctly 0.5% and a slant pay in the lower quintile of in each practical sense foggy size or for the most part twofold the upper trimming degree, is everything seen as flexible, able and enough capable over a level of smooth sullying rates. In the event that debasing is more noteworthy then the decision of the trimming degree winds up being more troublesome. In any case, before settling a trimming degree, two or three decisions ought to be assessed. The default decision of tuning constants of the methodologies thought about routinely gives poor outcomes. This is for the most part an issue for redirections, where no visual examination of the development of the segments or of disease times is conceivable. In an application several tuning constants would be endeavoured and visual examination of scrambling plots would be used to settle on the cut-point for clear.
VII. CONCLUSION
MANET is the new making movement which attracts customers to permit with no physical establishment paying little regard to their land zone, that is the reason it is every once in a while surmised as a foundation less framework. The expansion of more sensible, little and all the also persuading contraptions make MANET a snappiest influencing network. A surprisingly doled out framework is self-overseeing and versatile. Device in flexible with no arrangement framework should have the capacity to see the closeness of various contraptions and perform basic set up to help correspondence and sharing of data and affiliation [3]. The impacts of focuses number and focuses speed were investigated and isolated in different conditions keeping in mind the end goal to check the best number of center obsessions and prevalent best speed for any new portrayed out MANET. In the second bit of this examination, the effects of centers number and centers yield times were considered and bound in various conditions checking on the genuine focus to think about the best number of centers and all around best help time for any new laid out MANET. This examination was left to discuss the destinations that must be satisfied by the MANET and the differentiating perspectives that must be mulled over in the plotting of another MANET. Numerical models were accumulated and completed to overview the best elective that can be used as a touch of supporting the required number of centers and there speeds and what's more their break times in dealing with any new MANET.
REFERENCES
[1] Hinds, A, 2013. A Review of Routing Protocols for Mobile Ad-Hoc NETworks (MANET). International Journal of Information and Education Technology, [Online]. 3/1, 1-5. Available at: http://www.ijiet.org/papers/223-T0005.pdf [Accessed 29 January 2018].
[2] Jagtar, S, 2013. A Review Paper on Introduction to Mobile Ad Hoc Networks. International Journal of Latest Trends in Engineering and Technology (IJLTET), [Online]. 2/4, 143-150. Available at: https://www.ijltet.org/wp-content/uploads/2013/07/20.pdf [Accessed 29 January 2018].
[3] Dorri, A, 2015. SECURITY CHALLENGES IN MOBILE AD HOC NETWORKS: A SURVEY. International Journal of Computer Science & Engineering Survey (IJCSES), [Online]. 6/1, 15-31. Available at: https://arxiv.org/ftp/arxiv/papers/1503/1503.03233.pdf [Accessed 29 January 2018].
[4] Putra, S, 2010. An Overview on mobile ad hoc networks for the existing protocols and appliations. International Journal of Applications of Graph Theory, [Online]. 2/1, 87-105. Available at: http://airccse.org/journal/graphhoc/papers/0310jgraph7.pdf [Accessed 29 January 2018].
[5] Mohsin Rahman Salfi, U, 2018. A STUDY OF MOBILE AD-HOC NETWORKS -ISSUES AND CHALLENGES. International Journal of Advanced Research in Computer Science, [Online]. 6/7, 93-96. Available at: http://ijarcs.info/index.php/Ijarcs/article/viewFile/2574/2562 [Accessed 29 January 2018].
[6] Bang, Ankur, 2013. MANET : History,Challenges And Applications. International Journal of Application or Innovation in Engineering & Management (IJAIEM), [Online]. 2/9, 249-251. Available at: http://ijaiem.org/volume2issue9/IJAIEM-2013-09-27-063.pdf [Accessed 29 January 2018].
[7] H, Banwari, 2013. Routing Algorithms for MANET: A Comparative Study. International Journal of Engineering and Innovative Technology (IJEIT), [Online]. 2/9, 193-197. Available at: http://www.ijeit.com/vol%202/Issue%209/IJEIT1412201303_35.pdf [Accessed 29 January 201
[2] Jagtar, S, 2013. A Review Paper on Introduction to Mobile Ad Hoc Networks. International Journal of Latest Trends in Engineering and Technology (IJLTET), [Online]. 2/4, 143-150. Available at: https://www.ijltet.org/wp-content/uploads/2013/07/20.pdf [Accessed 29 January 2018].
[3] Dorri, A, 2015. SECURITY CHALLENGES IN MOBILE AD HOC NETWORKS: A SURVEY. International Journal of Computer Science & Engineering Survey (IJCSES), [Online]. 6/1, 15-31. Available at: https://arxiv.org/ftp/arxiv/papers/1503/1503.03233.pdf [Accessed 29 January 2018].
[4] Putra, S, 2010. An Overview on mobile ad hoc networks for the existing protocols and appliations. International Journal of Applications of Graph Theory, [Online]. 2/1, 87-105. Available at: http://airccse.org/journal/graphhoc/papers/0310jgraph7.pdf [Accessed 29 January 2018].
[5] Mohsin Rahman Salfi, U, 2018. A STUDY OF MOBILE AD-HOC NETWORKS -ISSUES AND CHALLENGES. International Journal of Advanced Research in Computer Science, [Online]. 6/7, 93-96. Available at: http://ijarcs.info/index.php/Ijarcs/article/viewFile/2574/2562 [Accessed 29 January 2018].
[6] Bang, Ankur, 2013. MANET : History,Challenges And Applications. International Journal of Application or Innovation in Engineering & Management (IJAIEM), [Online]. 2/9, 249-251. Available at: http://ijaiem.org/volume2issue9/IJAIEM-2013-09-27-063.pdf [Accessed 29 January 2018].
[7] H, Banwari, 2013. Routing Algorithms for MANET: A Comparative Study. International Journal of Engineering and Innovative Technology (IJEIT), [Online]. 2/9, 193-197. Available at: http://www.ijeit.com/vol%202/Issue%209/IJEIT1412201303_35.pdf [Accessed 29 January 201