Static Nodes Research Articles

Comparative Cluster Based Mobile Routing Approach for Energy Efficiency in Optimization of Node location in WSNs

Background & Objective: The Energy efficiency in optimization of node sensor location is considered as a design on Comparatively Cluster Based Mobile Routing Approach (CCBMRA) likewise circle coverage and elliptical coverage. Location of boundary has deployment with CCBMRA distribution of anchor node and un-anchor node or static sensor node. Methods: This proposed method has applied for distributed by anchor node positioned to measurements of employing received signal strength. So it is important for intermediate processing phase to achieved accurate positioning of SSN (Static Sensor Node). Moreover, ASN (Anchor Sensor Node) transmitted signal accurate computational and energy efficiency in optimization through reduces the number of cost factor, time and utilization of anchor node location. The research has established algorithm and simulation experimental based mobile node localisation routing approached. Result and Conclusion: The experimental has achieved higher localisation precision in less nodes. This paper suggests algorithm based on CCBMRA.

Study on the sensitivity of multi-slice spiral CT in diagnosis of lymph node metastasis in different lymph node stations of gastric cancer

Objective: To study the sensitivity of multi-slice spiral CT in the diagnosis of lymph node metastasis in different lymph node stations of gastric cancer. Methods: A retrospective series of case study was employed in the research. Inclusion criteria: (1) patients undergoing preoperative abdominal CT scan plus enhanced examination, and data in the image archiving and communication system of Sun Yat-sen University Cancer Center; (2) patients undergoing total or subtotal gastrectomy plus D2 or D1+ lymphadenectomy, with more than 15 harvested lymph nodes and more than 1 metastatic lymph node confirmed by postoperative pathology; (3) WHO pathological classification defined as gastric adenocarcinoma; (4) no history of lymph node tuberculosis, giant lymph node hyperplasia, lymphoma or other diseases resulting in enlarged lymph nodes; (5) no history of gastrectomy; (6) no preoperative neoadjuvant therapy. Clinicopathologic data of gastric cancer patients at the Department of Gastric and Pancreatic Surgery, Sun Yat-sen University Cancer Center from January 2009 to December 2012 were retrospectively analyzed. Using the pathologically positive lymph nodes as a reference, the sensitivity of CT-positive lymph nodes was calculated (total number of positive image lymph nodes/total number of positive pathological lymph nodes) and complete coincidence rate (number of case defined as complete coincidence/number of case with positive pathologic lymph nodes; complete coincidence indicated that the number of positive image lymph nodes was consistent with the number of positive pathologic lymph nodes in each lymph node station). The χ(2) test was used to compare the sensitivity of CT in the diagnosis of lymph node metastasis in each lymph node station. Results: A total of 228 patients with pathology-proven gastric cancer were enrolled in the study, including 147 male and 81 female. The overall sensitivity of CT in diagnosis of metastatic lymph nodes in gastric cancer was 68.7% (1769/2576). The sensitivity of CT in diagnosis of lymph node metastasis of groups 1 to 8 from high to low was group 3 [81.1% (506/624)], group 7 [73.9% (246/333)], group 2 [70.3% (111/158)], group 6 [68.7% (248/361)], group 4 [68.1% (262/385)], group 8 [60.4% (116/192)], group 1 [53.8% (155/288)], group 5 [47.1% (82/174)]. The CT diagnostic sensitivity of group 3 was significantly higher than the overall level (χ(2)=37.689, P<0.001). The CT diagnostic sensitivity of group 5 was significantly lower than the overall level (χ(2)=34.387, P<0.001). The CT diagnostic sensitivity of group 1 was also significantly lower than the overall level (χ(2)=25.918, P<0.001). Significant differences were not found in the CT diagnostic sensitivity of group 2, 4, 6, 7, 8 compared with the overall level (all P>0.05). The complete coincidence rate was 56.9% (536/942) between pathological positive lymph nodes and CT positive lymph nodes. The highest complete coincidence rate was observed in group 3 (68.0%, 123/181) and the lowest was in group 1 (41.4%, 46/111), whose difference was statistically significant (χ(2)=9.673, P=0.002). Conclusion: The sensitivity of CT in diagnosis of lymph nodes in different lymph node stations of gastric cancer is different.

On the distribution of nodal distances in random wireless ad hoc network with mobile node

The distribution of nodal distance is of vital importance in connectivity analysis of wireless ad hoc networks. Existing research on distance distribution focuses on static network deployment. In this paper we consider the distribution of nodal distance between uniformly deployed static nodes and multiple mobile nodes. The Random-Way-Point (RWP) mobility model is applied for mobile nodes. We derive the analytic expressions of the cumulative distribution function and probability density function of the nodal distance in square and circular areas. The validity of our theoretical results is verified through computer simulations, which show that the analytical results are consistent with the simulated results.

Lifetime Estimation of WSN with Enhanced Pairwise Directional Geographic Routing

This research work proposes an enhanced pair-wise directional geographic routing (EPWDGR) technique using the directional antenna and compares it with the conventional pair-wise directional geographic routing (PWDGR) method that uses the Omni-directional antenna. PWDGR has two key limitations - minimum network lifetime and its use of static nodes. The EPWDGR technique aims to overcome these pitfalls by incorporating a directional antenna patch that requires lesser power, thereby increasing the network lifetime. The validations have been performed through simulations that use a random waypoint mobility model which is more practical. Varying performance metrics have been used for the estimation of network lifetime. The EPWDGR also solves the energy bottleneck problem at the nodes near the sink.

AB002. Lymph node dissection under minimal invasive surgery

: A minimal invasive approach for lung cancer has become standard of care in many major thoracic centres around the world. In our institution at the Department of Thoracic Surgery at the University Hospital of Copenhagen, 90% of all lung cancer operations are performed with a minimal invasive approach. However implementation was slow in the beginning of the minimal invasive era. Thoracic surgeons were concerned about two major issues preventing implementation. Firstly, how to control major bleeding from the pulmonary artery? Secondly, the oncological efficacy of a minimal invasive approach was a concern. Many thoracic surgeons doubted that a systematic lymph node dissection under minimal invasive surgery could be performed with the same quality as in open surgery. Like in any other surgical approach, there is a considerable learning curve for learning the skills to perform a minimal invasive lobectomy. It is my experience from proctoring many thoracic surgeons around the world in video-assisted thoracoscopic surgery (VATS) lobectomy, that first step is to learn the techniques of performing the lobectomies. Then the technique of performing lymph node dissection has a separate learning curve to overcome. The key recommendation is to perform an “en bloc” resection with all lymphatic tissue and fatty tissue in one station. Keeping the capsule of the lymph intact decreases the risk of tumour cell spreading. Removing the lymph nodes this way makes it easier and more reliable for the pathologist to count the number of lymph nodes removed. The lymph node dissection is usually performed using monopolar electro coagulation (electro cautery hook) or using bipolar advanced energy devices such as Ligasure or Harmonic scalpel. The electro cautery hook is less costly and easy to use. However, there is a risk for injuring the pulmonary artery during dissection and the there is a considerable risk of lateral thermal spread up to 1 cm for the target area. This should be taken into consideration when dissecting near the recurrent nerve in the aorta-pulmonary window. Using advanced energy on the other hand is more expensive, however bipolar advanced energy devices can be used in close proximity to vascular structures and nerves with minimal risk of injury. Limiting bleeding by sealing minor vessels improves the overview of the dissection and thereby makes the dissection easier and safer. On the right side the lymph node dissection in the superior mediastinum is performed as an “en bloc” resection of the lymph nodes in station 2R and 4R. The dissection begins inferior to the azygos vein along the pulmonary artery lifting the azygos vein up. The azygos vein can be divided, but in most cases this is not necessary. The smaller vessels from the superior vena cava (SVC) are sealed. Dissection continues along the SVC, the pericardium and trachea. Pleura over this area are divided and the dissection is continued to the top area near the subclavian artery. In the angle between the subclavian artery and trachea dissection should be performed carefully to avoid injuring the recurrent nerve. The specimen with lymph nodes and fatty tissue is removed via the utility port, which should be protected with a port protector to avoid seeding of tumour cells. The subcarinal area (station 7) is approached superior to the inferior vein. Dissection is continued until the left main bronchus is seen and 2 cm of the left main bronchus should be cleared for lymph nodes along with bronchus intermedius. Oesophagus can be retracted with the suction to open the space and facilitate dissection. It is recommended to divide the inferior ligament, when removing the paraoesophageal lymph nodes (station 8) and the lymph nodes in the lymph nodes in the inferior ligament (station 9). On the left side, lymph node dissection in the aorta-pulmonary window (stations 5 and 6) is initiated along the superior part of the aortic arch, identifying the vagal nerve. The recurrent nerve can easily be localized, when following the vagal nerve to the inferior part of the aortic arch. Once the recurrent nerve is identified, the risk of injury and traction is less. The majority of injuries to recurrent nerve during lymph node dissection is due to traction and causes neuropraxia. Fortunately this type of injury is temporary, however patients are often hoarse for several months. After the recurrent nerve is localized, dissection continues along the phrenic nerve and pleura are opened. The dissection continues along the main pulmonary artery and all the lymph nodes and fatty tissue can be removed via the utility port and a port protector like the right side. The lymph nodes in stations 7, 8 and 9 can removed similar to removal on the right side, however the dissection is deeper in the subcarinal area on the left side and retraction with 2 or more instruments facilitates the dissection.

Ant Colony Optimization Based Routing Scheme in Vehicular Delay Tolerant Networks

Delay Tolerant Networks finds its application in variety of environments and addresses issues like intermittent connection, long and variable delays and high latency. Vehicular Delay Tolerant Networks was introduced due to its various characteristic matches with DTNs. In particular class of VDTN there are two types of nodes: Stationary and Mobile nodes. Stationary nodes are deployed along the roadside and mobile nodes are constrained to move over the roads with variable speeds. This letter presents a new routing algorithm based on Ant Colony Optimization in Vehicular Delay Tolerant Network. We performed extensive simulation in ONE simulator and compare with Probabilistic Bundle Relaying Scheme to gauge the benefits of Ant Colony Optimization based scheme over Probabilistic Bundle Relaying scheme.

Efficient data management and control over WSNs using SDN‐enabled aerial networks

SummaryThe recent developments in collaborative search, acquisition, and tracking have hoisted the geographical barrier. The network between unmanned aerial vehicles (UAVs) and wireless sensor networks (WSNs) is one such collaboration, which comprises battery‐powered static sensor nodes that act as sources and sinks and UAVs that act as relays. This collaborative network presents with opportunities and advantages, but at the same time, configuration of such networks is an arduous task. The WSN nodes are characterized by constant depleting power. Their network itself requires constant management and reconfiguration. These requisites can be slaked through the formation of an efficient data dissemination algorithm, which acclimates according to the network state. Considering this, a data dissemination approach is presented in this paper, which constructs a virtual topology predicated on the charge of WSN nodes utilizing software‐defined networks (SDNs) through UAVs. The topology is constantly monitored and reconfigured when required. The aerial nodes are equipped with multiple‐input multiple‐output (MIMO) antennas in order to facilitate simultaneous communication with the ground nodes, the base station, and the SDN controller. An efficient sleep timer and backoff counter strategies are also utilized by the proposed approach. The SDN controller facilitates the topology formation and maintenance of a sleep timer and a backoff counter. The proposed model is compared with clustered hierarchical layouts and hexagonal cell layouts through the network simulations. The results suggest significant improvements in the proposed model for various metrics, such as lifetime, delay, latency, delivery ratio, and throughput in comparison with the existing solutions.

An Enhanced Channel Access Method to Mitigate the Effect of Interference Among Body Sensor Networks for Smart Healthcare

Wireless body sensor networks (WBSNs) are exposed to interferences such as intrabody and interbody interferences. Intrabody interference exists within a WBSN and interbody interference occurs between the WBSNs, which degrades the overall system performance. The impact of interference becomes more intense with the increase in the number of nodes. The most popular standard for WBSNs, the IEEE 802.15.4 standard, is very well suited for short-range communication and low-power wireless sensor networks. However, this standard is not robust enough to handle the interferences when multiple nodes/WBSNs come in close to each other. In this paper, a new scheme that can mitigate the effect of interference called the interference reduction channel access mechanism (IR-CAM) is proposed. In this mechanism, the coordinator adjusts the contention window size and frame length adaptively to reduce the effect of interference. The simulations are carried out for both static and mobile nodes. The simulation results prove the efficacy of the new scheme by comparing with the existing schemes in terms of normalized throughput, average end-to-end delay, average energy consumption, packet drop rate, and packet delivery ratio. In static, the proposed method outperforms the IEEE 802.15.4e standard and the transmission model by 33% and 10% in terms of throughput and a 3% drop in the average end-to-end delay when compared with the IEEE 802.15.4e standard. In mobility, the proposed method has 53% and 27% reduction in average energy consumption when compared to the IEEE 802.15.4e and transmission model. The simulation also includes the performance analysis for multiple WBSNs.

Reauthentication scheme for mobile wireless sensor networks

Wireless sensor networks consist of static as well as mobile sensor nodes. Due to deployment of the sensor nodes, generally in an unattended and hostile environment, it becomes a critical issue as well as a cumbersome task to safeguard these nodes against various kinds of security attacks. The mobility of sensor nodes is a significant issue because these nodes continuously move from one region to another region and reconnect to other sensor nodes. Reauthentication and locating the node movement are the primary security issues in Mobile Wireless Sensor Networks (MWSNs). Many previous security algorithms available in the literature only consider the issues of static sensor nodes. In this paper, we propose an energy efficient mobile node authentication algorithm. For mobile node authentication, we design the reauthentication approach for mobile nodes and also design an authentication framework for securing MWSNs. The proposed protocol is compared with existing mobile node authentication protocols available in the literature. We observe that the proposed protocol provides low overhead while achieving the security requirements for mobile wireless sensor networks.

Network Coding-Based Flooding with a Mobile Sink in Low-Duty-Cycle Wireless Sensor Networks

Network coding and schedule-based flooding trees have been widely deployed to improve the performance of a flooding process in low-duty-cycle wireless sensor networks (WSNs). However, the conventional schemes induce too long flooding delay because there is only one static sink node as a single source. In this paper, we use a mobile sink to travel around the monitoring area. When the mobile sink travels to a position, it serves as a new source. Since multiple sources can simultaneously forward data packets, flooding speed can be accelerated. We investigate the new problems when both a mobile sink and network coding are integrated with a schedule-tree-based flooding scheme. We model the process to deliver multiple encoded packets from the source to a node as a Markov process, and we theoretically investigate how to minimize the total expected flooding delay with a mobile sink by considering all the possible traveling orders of the branches. We propose a heuristic algorithm to obtain an appropriate trajectory by accounting for the effect of traveling delay of the mobile sink. Simulation results show that our proposed flooding scheme with a mobile sink can significantly reduce the flooding delay.

Reducing neighbor discovery latency in docking applications

Neighbor discovery is important for docking applications, where mobile nodes communicate with static nodes situated at various rendezvous points. Among the existing neighbor discovery protocols, the probabilistic methods perform well in average cases but they have aperiodic, unpredictable, and unbounded discovery latency. Yet, deterministic protocols can provide bounded worst-case discovery latency by sacrificing the average-case performance. In this study, we propose a mobility-assisted slot index synchronization (MASS), which is a new synchronization technique that can improve the average-case performance of deterministic neighbor discovery protocols via slot index synchronization without incurring additional energy consumption. Furthermore, we propose an optimized beacon strategy in MASS to mitigate beaconing collisions, which can lead to discovery failures in situations where multiple neighbors are in the vicinity. We evaluate MASS with theoretical analysis and simulations using real traces from a tourist tracking system deployed at the Mogao Grottoes, which is a famous cultural heritage site in China. We show that MASS can reduce the average discovery latency of state-of-the-art deterministic neighbor discovery protocols by up to two orders of magnitude.

Dynamic Distributed Secure Storage Against Ransomware

In just a few years, ransomware evolved into one of the most pernicious threats on the web. From hijacking private disks, the cybercriminals moved to disabling hospital networks, while the cyberwarriors launched destructive cyberwar exercises masquerading as ransomware. To match the variety of attacks, there is also a variety of promising proposals for the mitigation of the ransomware problem by disrupting the attack cycle at various points. None of them seems to be eliminating the vulnerability of static nodes in dynamic networks. We put forward the idea that ransomware is a symptom of a broader problem of architectural imbalance in social computation, while the processes are dynamic and nonlocal, the storage is static and local. We study and discuss some paths toward dynamic, nonlocal, and secure storage. Furthermore, we provide a toy method for locally encrypting the data that can provide a balance of high security and encryption speed.

Internet of Things ‐ integrated IR‐UWB technology for healthcare applications

SummaryRecent technology developments have produced small and smart biomedical sensors, which can be worn or implanted in the human body. These biosensors create closed wireless networks named Wireless Body Area Networks (WBAN). The WBAN will continuously observe the physiological state of patients for both diagnosis and prevention. Those include on‐body measurements such as the Electrocardiogram (ECG), Electroencephalogram (EEG), temperature, and blood pressure. Ultra‐Wide‐Band (UWB) is a technology that has received a lot of attention due to several unique features such as secure transmission, low noise, and low energy consumption. Given the fact that the patients' well‐being might be dependent on the accurate realization of such networks, a high level of design and implementation accuracy are maintained throughout the system. In this paper, we proposed an Impulse‐Radio Ultra‐Wideband system, which is composed of static biomedical nodes mounted on a patient's body to collect vital data and send it wirelessly to a central node or subsequent analysis by healthcare professionals. The performance of this network, such as the effect of node location, the number of transmitted symbols, multiuser interference, and intersymbol interference, is evaluated. We also study the physical layer and quality of service of this proposed architecture.

A Novel Centralized Range-Free Static Node Localization Algorithm with Memetic Algorithm and Lévy Flight.

Node localization, which is formulated as an unconstrained NP-hard optimization problem, is considered as one of the most significant issues of wireless sensor networks (WSNs). Recently, many swarm intelligent algorithms (SIAs) were applied to solve this problem. This study aimed to determine node location with high precision by SIA and presented a new localization algorithm named LMQPDV-hop. In LMQPDV-hop, an improved DV-Hop was employed as an underground mechanism to gather the estimation distance, in which the average hop distance was modified by a defined weight to reduce the distance errors among nodes. Furthermore, an efficient quantum-behaved particle swarm optimization algorithm (QPSO), named LMQPSO, was developed to find the best coordinates of unknown nodes. In LMQPSO, the memetic algorithm (MA) and Lévy flight were introduced into QPSO to enhance the global searching ability and a new fast local search rule was designed to speed up the convergence. Extensive simulations were conducted on different WSN deployment scenarios to evaluate the performance of the new algorithm and the results show that the new algorithm can effectively improve position precision.

Does the number of lymph nodes harvested reflect the width of lymphadenectomy in gastric carcinoma? Results of a prospective comparative study

Objective: The aim of this study was to evaluate the sufficiency of the surgical technique according to the extended lymph node dissection in gastric cancer patients (GCPs). We supported our findings with the determination of number of lymph nodes (LNs) in lymph node stations with an autopsy performed on cadavers without any type of cancer. Method: 55 GCPs were enrolled. Extended lymphadenectomy was performed on 23 autopsy cases as a comparative group. Total gastrectomy and D2 dissection was performed as the standard surgical approach. Results: According to TNM classification, nine cases (18%) were stratified to stage I, three (6%) to stage II, 22 (36%) to stage III, and 21 (40%) to stage IV. The median number of excised LNs from the 55 cases was 47 (24-95), metastatic LNs were 15 (1-71) in patients. In the autopsy group the median number was 72 (50-91). If D1 dissection had been performed instead of D2 dissection in the 55 cases, the median number of excised LNs would have been 24 (10–57) and metastatic LNs would have been 5 (1–45). If D1 dissection had been performed in the autopsy group, the median number of excised LNs would have been 36 (20–49). Conclusions: The number of LNs harvested does not reflect the width of lymphadenectomy. D2 dissection must be performed stationary to achieve adequate extension of the lymphadenectomy. Possible skip metastasis and stage migration will be also reduced so that more efficient oncological results will be achieved.

Enhanced PEGASIS using Dynamic Programming for Data Gathering in Wireless Sensor Network

A number of routing protocol algorithms such as Low-Energy Adaptive Clustering Hierarchy (LEACH) and Power-Efficient Gathering in Sensor Information Systems (PEGASIS) have been proposed to overcome the problem of energy consumption in Wireless Sensor Network (WSN) technology. PEGASIS is a development of the LEACH protocol, where within PEGASIS all nodes are active during data transfer rounds thus limiting the lifetime of the WSN. This study aims to propose improvements from the previous PEGASIS version by giving the name Enhanced PEGASIS using Dynamic Programming (EPDP). EPDP uses the Dominating Set (DS) concept in selecting a subset of nodes to be activated and using dynamic programming based optimization in forming chains from each node. There are 2 topology nodes that we use, namely random and static. Then for the Base Station (BS), it will also be divided into several scenarios, namely the BS is placed outside the network, in the corner of the network, and in the middle of the network. Whereas to determine the performance between EPDP, PEGASIS and LEACH, an analysis of the number of die nodes, number of alive nodes, and remaining of energy were analyzed. From the experiment result, it was found that the EPDP protocol had better performance compared to the LEACH and PEGASIS protocols in terms of number of die nodes, number of alive nodes, and remaining of energy. Whereas the best BS placement is in the middle of the network and uses static node distribution topologies to save more energy.

RETRACTED ARTICLE: Mobile cluster head selection using soft computing technique in wireless sensor network

Wireless sensor networks generally consist of static sensor node, which can be deployed to monitor the environment. The network is built by the sensor nodes, and the data from the source reach base station by passing through a number of sensor nodes. This causes loss of energy at the sensor nodes. To reduce energy loss of the sensor nodes in WSN, cluster-based topology can be used. Sensor nodes are grouped into clusters. Each cluster contains one cluster head for effective communication. Cluster head collects the data from the sensor nodes and sends to the base station. This causes fast depletion of cluster heads energy. To overcome energy problem, we have proposed a novel mobile data gathering in WSN by soft computing-based CH selection and clustering. It is based on fuzzy inference system. The smart CH selection and vehicular data gathering reduce the time and energy loss due to uploading. Due to reduced energy loss, the lifetime of network is also increased. In this paper, we compared the smart CH selection technique with high-energy CH selection on the quality measures packet loss, collection delay, residual energy, distance travelled and network lifetime. The proposed smart CH selection-based vehicular data gathering is produced better results compared to the other methods.

A Distance-Vector-Based Multi-Path Routing Scheme for Static-Node-Assisted Vehicular Networks.

Vehicular Ad hoc NETworks (VANET) has been well studied for a long time as a means to exchange information among moving vehicles. As vehicular networks do not always have connected paths, vehicular networks can be regarded as a kind of delay-tolerant networks (DTNs) when the density of vehicles is not high enough. In this case, packet delivery ratio degrades significantly so that reliability of networks as an information infrastructure is hardly held. Past studies such as SADV (Static-node Assisted Data dissemination protocol for Vehicular networks) and RDV (Reliable Distance-Vector routing) showed that the assistance of low-cost unwired static nodes located at intersections, which work as routers to provide distance-vector or link-state routing functions, significantly improves the communication performance. However, they still have problems: SADV does not provide high-enough delivery ratio and RDV suffers from traffic concentration on the shortest paths. In this paper, we propose MP-RDV (Multi-Path RDV) by extending RDV with multiple paths utilization to improve performance against both of those problems. In addition, we apply a delay routing metric, which is one of the major metrics in this field, to RDV to compare performance with the traffic-volume metric, which is a built-in metric of RDV. Evaluation results show that MP-RDV achieves high load-balancing performance, larger network capacity, lower delivery delay, and higher fault tolerance against topology changes compared to RDV. As for routing metrics, we showed that the traffic-volume metric is better than the delay one in RDV because delay measurement is less stable against traffic fluctuation.

Local Traffic Aware Unicast Routing Scheme for Connected Car System

Connected cars are equipped with a rich set of sensors, such as GPS, accelerometer, video cameras, and pollution detectors. The information generated by these sensors can be used to offer a wide range of on-demand services, such as congestion notification, parking lots, and video surveillance. These services need a reliable and low latency unicast communication scheme in order to efficiently deliver the information requested by drivers. In this paper, a local traffic aware unicast routing scheme is proposed. To overcome network fragmentation, the proposed scheme relies on base stations and virtual base stations to transmit information from source car to the destination car using backhaul link. In this model, as base stations are sparsely deployed in the junction areas, a car moving in the junction area acts as a virtual base station node to support the routing process in the absence of a base station. Moreover, it avoids the impact of unreliable channel on information delivery. In the proposed scheme, each base station and virtual base station uses the short status messages (beacons) exchanged by the cars to form a local database of car locations. The stored information is used to find a base station or virtual base station that offers a minimum delay path to the destination car. The simulation results show that the proposed scheme outperforms the existing routing schemes in terms of end-to-end delay and packet delivery ratio. The proposed scheme is also validated by a connected car prototype built in an indoor laboratory environment.

Dynamic route scheduler in vehicular ad hoc network for smart crowd control

Revenue generated by tourism is positively correlated with the development of any city. In recent years, tourism is getting peak focus among the government, local bodies, and researchers. This has led to increase in initiatives to grow tourism in and across the country. Being one of the most flourishing sectors, tourism in India shows bold signals of emerging as a strong participant in the world of tourism. In addition to safeguarding its culture and deep-rooted traditional values, tourism provides a way to increase employment opportunities as well as increase the foreign exchange within the country. There are many open research problems arising in the domain, which need the attention of researchers. City traffic management is one among the major concern for cities around the world. Scheduling dynamic travel plans for tourists with crowd and traffic awareness has high scope for research. In this paper, a system is proposed which connects the vehicles to a centralized sink for getting the optimal routes. Route scheduling is done based on a prediction model. Different parameters were collected from the environment that includes crowd, traffic, and schedule of other vehicles. The system has modules like static nodes, mobile nodes, host nodes, and sink node for the control and management. Selection of path and protocol is a primary strategy to design any VANET systems. Hence, performance analysis of routing protocols for the proposed system is done as a major step in selection of protocols. Packet delivery ratio, jitter, and throughput are common measures used for the comparison of protocols.