Research On Routing Algorithm For Medical Internet Of Things

We are witnessing the formation of an Io T(Internet of Things),where real-world entities(e.g.,people,plants,cars)augmented with computing devices(e.g.,smartphones,tablets,sensor nodes),sensors(e.g.,humidity sensors,microphones,cameras),and actuators(e.g.,motors,LED(Light Emitting Diode))are connected to the Internet,enabling them to publish their generated data on the Web.By mashing up these “Smart Things” with the services and data available on the Web,Io MT(Internet of Medical Things)applications can be created.As they have increased access to highspeed Internet and smartphones,many patients have begun to use mobile applications to meet various health needs.The Internet of Medical Things has three basic elements.The first is "things",which are objects,including doctors,patients,medical equipment,etc.;the second is "network",which is process;and the third is "connection",which is the interaction of information.The wireless routing algorithm based on the Internet of Things mainly studies two aspects: one is how to make these objects form a network,and the other is how to effectively transmit data after the network is formed.In this work,the medical field is used to construct a medical monitoring system based on wireless sensor network.For many Io T(Internet of Things)applications,routing and sensor search are essential services.The sensor search service allows for quickly finding Smart Things in the Io T(Internet of Things)based on the real-world states perceived by their embedded sensors.To facilitate sensor search and also other Io T(Internet of Things)applications,a routing service is required to enable efficient communication of information among Smart Things and other Internet nodes.A WSN(Wireless Sensor Network)is made of tiny sensor nodes usually deployed in high density within a targeted area to monitor a phenomenon of interest such as temperature,vibration or humidity.The WSN can be employed in various applications(e.g.,Structural monitoring,agriculture,environment monitoring,machine health monitoring,military,and health).For each application area there are different technical issues and remedies.Various challenges need to be considered while setting up a WSN,including limited computing,memory and energy resources,wireless channel errors and network scalability.The topology of any network is important and WSN are no exception.In order to effectively model an energy-efficient routing algorithm,the topology of the WSN must be factored in.However,little work has been done on routing for WSN with regular patterned topologies,except for the SPF(Shortest Path First)routing algorithms.The issue with the SPF algorithm is that it requires global location information of the nodes from the sensor network,which proves to be a drain on the network resources.In this thesis a novel algorithm namely,BRALB(Biased Random Algorithm for Load Balancing)is proposed to overcome the issues faced in routing data within WSNs with regular topologies such as square-base topology and triangle-based topology.It is based on random walk and probability.The proposed algorithm uses probability theory to build a repository of information containing the estimate of energy resources in each node,in order to route packets based on the energy resources in each node and thus does not require any global information from the network.It is shown in this thesis by statistical analysis and simulations that BRALB uses the same energy as the shortest path first routing as long as the data packets are comparable in size to the inquiry packets used between neighbours.It is also shown to balance the load(i.e.the packets to be sent)efficiently among the nodes in the network.In most of the WSN applications the messages sent to the base station are very small in size.Therefore BRALB is viable and can be used in sensor networks employed in such applications.However,one of the constraints of BRALB is that it is not very scalable;this is a genuine concern as most WSNs deployment is large scale.In order to remedy this problem,C-BRALB(Clustered Biased Random Algorithm for Load Balancing)has been proposed as an extension of BRALB with clustering mechanism.The same clustering technique used in Improved Directed Diffusion(IDD)has been adopted for C-BRALB.The routing mechanism in C-BRALB is based on energy biased random walk.This algorithm also does not require any global information apart from the initial flooding initiated by the sink to create the clusters.It uses probability theory to acquire all the information it needs to route packets based on energy resources in each cluster head node.The simulation results show that using this algorithm can improve the network running speed by about 50% compared with BRALB..It is also shown to balance the load(i.e.the packets to be sent)among the neighbouring cluster head nodes.